Structured discrete shape approximation: Theoretical complexity and practical algorithm.
Andreas M. TillmannLeif KobbeltPublished in: Comput. Geom. (2021)
Keyphrases
- computational complexity
- worst case
- computational cost
- preprocessing
- space complexity
- np hard
- learning algorithm
- polygonal approximation
- detection algorithm
- optimization algorithm
- increase in computational complexity
- prior information
- theoretical analysis
- cost function
- k means
- dynamic programming
- expectation maximization
- complexity analysis
- closed form
- convex hull
- shape features
- recognition algorithm
- approximation algorithms
- linear complexity
- convergence rate
- greedy algorithm
- segmentation algorithm
- shape model
- matching algorithm
- energy function
- real world
- computationally efficient
- graph cuts
- significant improvement
- search space
- optimal solution
- objective function
- genetic algorithm