Epsilon-covering: a greedy optimal algorithm for simple shapes.
Tuong NguyenIsabelle SivignonPublished in: CCCG (2016)
Keyphrases
- dynamic programming
- locally optimal
- greedy heuristic
- optimal solution
- detection algorithm
- worst case
- computational cost
- computational complexity
- learning algorithm
- preprocessing
- globally optimal
- exhaustive search
- np hard
- experimental evaluation
- high accuracy
- linear programming
- optimization algorithm
- similarity measure
- greedy algorithm
- path planning
- computationally efficient
- expectation maximization
- closed form
- theoretical analysis
- optimal parameters
- probabilistic model
- cost function
- polygonal approximation