An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon.
Joy BhaduryCraig A. ToveyPublished in: Int. J. Comput. Math. (2010)
Keyphrases
- convex hull
- np hard
- detection algorithm
- high accuracy
- cost function
- globally optimal
- computational complexity
- objective function
- learning algorithm
- search space
- preprocessing
- dynamic programming
- recognition algorithm
- k means
- parallel implementation
- neural network
- boundary points
- convergence rate
- times faster
- tree structure
- optimization algorithm
- segmentation algorithm
- worst case
- experimental evaluation
- expectation maximization
- particle filter
- simulated annealing
- significant improvement
- complexity analysis
- polygonal approximation
- similarity measure