Structured Discrete Shape Approximation: Theoretical Complexity and Practical Algorithm.
Andreas M. TillmannLeif KobbeltPublished in: CoRR (2019)
Keyphrases
- worst case
- np hard
- learning algorithm
- computational cost
- k means
- detection algorithm
- increase in computational complexity
- computational complexity
- theoretical analysis
- space complexity
- dynamic programming
- probabilistic model
- linear complexity
- image segmentation
- matching algorithm
- search space
- polynomial time approximation
- approximation ratio
- polygonal approximation
- complexity analysis
- recognition algorithm
- memory requirements
- prior information
- energy function
- real world
- optimal solution
- cost function
- preprocessing
- error bounds
- closed form
- approximation error
- computational geometry
- state space
- objective function