On the Complexity of the Plantinga-Vegter Algorithm.
Felipe CuckerAlperen Ali ErgürJosué Tonelli-CuetoPublished in: Discret. Comput. Geom. (2022)
Keyphrases
- learning algorithm
- worst case
- experimental evaluation
- preprocessing
- detection algorithm
- theoretical analysis
- dynamic programming
- significant improvement
- recognition algorithm
- search space
- computational complexity
- cost function
- computational cost
- input data
- matching algorithm
- optimal solution
- segmentation algorithm
- selection algorithm
- convex hull
- times faster
- space complexity
- computationally efficient
- high accuracy
- search algorithm
- high computational complexity
- single pass
- data sets
- lower complexity
- convergence rate
- simulated annealing
- k means