Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.