Forest-like abstract Voronoi diagrams in linear time
Journal
Computational Geometry: Theory and Applications
Journal Volume
68
Pages
134-145
Date Issued
2018
Author(s)
Abstract
Voronoi diagrams are a general framework covering many types of concrete diagrams for different types of sites or distance measures. Generalizing a famous result by Aggarwal et al. [1] we prove the following. Suppose it is known that inside a closed domain D the Voronoi diagram V(S) is a tree, and for each subset S′⊂S, a forest with one face per site. If the order of Voronoi regions of V(S) along the boundary of D is given, then V(S) inside D can be constructed in linear time. © 2017 Elsevier B.V.
Subjects
Abstract Voronoi diagrams; Forest structures; General distance; Linear-time algorithms; Voronoi diagrams
Other Subjects
Clustering algorithms; Computational geometry; Forestry; Distance measure; Forest structure; General distance; Linear time; Linear-time algorithms; Voronoi diagrams; Voronoi regions; Graphic methods
Type
journal article