A vector-based algorithm to generate and update multiplicatively weighted Voronoi diagrams for points, polylines, and polygons

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 constru...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Computers & geosciences Ročník 42; s. 118 - 125
Hlavní autori: Gong, Yongxi, Li, Guicai, Tian, Yuan, Lin, Yaoyu, Liu, Yu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier Ltd 01.05.2012
Predmet:
ISSN:0098-3004, 1873-7803
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí: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. ► We develop an algorithm to generate MWVDs for sites with mixed spatial extents. ► The method is vector-based and can explore the shape characteristic of the MWVDs. ► The method can generate both MWVDs and OVDs, and degeneration cases are considered. ► The method is accurate than raster-based method and is efficient for GIS applications.
Bibliografia:http://dx.doi.org/10.1016/j.cageo.2011.09.003
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0098-3004
1873-7803
DOI:10.1016/j.cageo.2011.09.003