Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
Computational Geometry: Theory and Applications
A Computational Basis for Conic Arcs and Boolean Operations on Conic Polygons
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Algorithmic Foundations of Geographic Information Systems, this book originated from the CISM Advanced School on the Algorithmic Foundations of Geographic Information Systems
Hi-index | 0.00 |
A Voronoi diagram is a basic data structure in geometry with many applications. Existing research studies have focused on ordinary Voronoi diagrams, and some vector-based algorithms have been developed to generate multiplicatively weighted Voronoi diagrams (MWVDs) for points. An algorithm to construct MWVDs for points, polylines, and polygons is raster-based and has drawbacks. We propose a vector-based algorithm to generate and update MWVDs for points, polylines, and polygons. The MWVDs of two sites characterize the geometric features of multiplicatively weighted Voronoi regions, and the algorithm for Boolean operations on conic polygons is the computational preliminary to the MWVDs of N sites. The proposed algorithm is vector-based and can deal with sites with mixed spatial extents and various weights. We implement the algorithm in C# and present several examples of generating and updating MWVDs.