An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles.
Pankaj K. AgarwalKyle FoxOren SalzmanPublished in: SODA (2016)
Keyphrases
- detection algorithm
- high quality
- learning algorithm
- dynamic programming
- improved algorithm
- computational complexity
- preprocessing
- linear programming
- experimental evaluation
- selection algorithm
- theoretical analysis
- objective function
- np hard
- voronoi diagram
- significant improvement
- probabilistic model
- high accuracy
- optimal solution
- k means
- estimation algorithm
- memory efficient
- optimization algorithm
- data sets
- tree structure
- times faster
- convergence rate
- principal curves
- optimal path
- highly efficient
- expectation maximization
- simulated annealing
- cost function
- lower bound
- image sequences