An iterative algorithm for the determination of voronoi vertices in polygonal and non-polygonal domains.
Francois AntonChristopher M. GoldPublished in: CCCG (1997)
Keyphrases
- voronoi diagram
- computational cost
- experimental evaluation
- learning algorithm
- computational complexity
- cost function
- np hard
- minimum length
- improved algorithm
- times faster
- optimization algorithm
- detection algorithm
- high accuracy
- preprocessing
- finite set of points
- matching algorithm
- computationally efficient
- theoretical analysis
- worst case
- significant improvement
- linear programming
- clustering method
- ant colony optimization
- convex hull
- graph structure
- weighted graph
- lower bound
- data structure
- attributed graphs
- optimal solution
- reinforcement learning