An O(n log n) Algorithm for the All-Farthest-Segments Problem for a Planar Set of Points.
Asish MukhopadhyayRobert L. Scot DrysdalePublished in: CCCG (2006)
Keyphrases
- convex hull
- boundary points
- learning algorithm
- equal length
- detection algorithm
- np hard
- dynamic programming
- worst case
- preprocessing
- initial set
- input data
- similarity measure
- finite set of points
- input pattern
- segmentation algorithm
- optimal solution
- cost function
- computational complexity
- objective function
- delaunay triangulations
- image set
- average distance
- geometric constraints
- closest point
- data streams
- feature space
- particle swarm optimization
- solution space
- lower bound
- probability distribution
- expectation maximization
- feature points