A simple and fast algorithm for computing discrete Voronoi, Johnson-Mehl or Laguerre diagrams of points.
H. MoulinecPublished in: CoRR (2022)
Keyphrases
- learning algorithm
- experimental evaluation
- times faster
- detection algorithm
- high accuracy
- similarity measure
- k means
- objective function
- matching algorithm
- path planning
- np hard
- cost function
- significant improvement
- search space
- computational complexity
- optimal solution
- dynamic programming
- genetic algorithm
- computational geometry
- preprocessing
- expectation maximization
- segmentation algorithm
- voronoi diagram
- decision trees
- discrete version
- tree structure
- optimization algorithm
- simulated annealing
- computational cost
- lower bound