Plane-Sweep Algorithm of O(nlogn) for the Inclusion Hierarchy among Circles.
Deok-Soo KimByunghoon LeeCheol-Hyung ChoKokichi SugiharaPublished in: ICCSA (3) (2004)
Keyphrases
- learning algorithm
- optimal solution
- optimization algorithm
- detection algorithm
- preprocessing
- high accuracy
- cost function
- computational cost
- recognition algorithm
- times faster
- computationally efficient
- experimental evaluation
- np hard
- computational complexity
- k means
- search space
- worst case
- simulated annealing
- theoretical analysis
- segmentation algorithm
- data structure
- convex hull
- tree structure
- digital plane
- improved algorithm
- image processing
- memory requirements
- three dimensional
- face recognition
- linear programming
- artificial neural networks
- genetic algorithm
- dynamic programming