An O(nlogn) algorithm for the all-farthest-segments problem for a planar set of points.
Robert L. Scot DrysdaleAsish MukhopadhyayPublished in: Inf. Process. Lett. (2008)
Keyphrases
- convex hull
- equal length
- optimization algorithm
- dynamic programming
- initial set
- preprocessing
- learning algorithm
- search space
- k means
- closest point
- boundary points
- expectation maximization
- cost function
- computational complexity
- optimal solution
- finite set of points
- polygonal approximation
- image set
- probabilistic model
- objective function
- solution space
- point sets
- input data
- average distance
- computational cost
- planar patches