TY - GEN
T1 - A hierarchical raster method for computing voronoi diagrams based on quadtrees
AU - Zhao, Renliang
AU - Li, Zhilin
AU - Chen, Jun
AU - Gold, C. M.
AU - Zhang, Yong
PY - 2002/12/1
Y1 - 2002/12/1
N2 - Voronoi diagram is a basic data structure in geometry. It has been increasingly attracting the investigation into diverse applications since it was introduced into GIS field. Most current methods for computing Voronoi diagrams are implemented in vector mode. However, the vector-based methods are good only for points and difficult for complex objects. At the same time, most current raster methods are implemented only in a uniformed-grid raster mode. There is a lack of hierarchical method implemented in a hierarchical space such as quadtrees. In this paper such a hierarchical method is described for computing generalized Voronoi diagrams by means of hierarchical distance transform and hierarchical morphological operators based on the quadtree structure. Three different solutions are described and illustrated with experiments for different applications. Furthermore, the errors caused by this method are analyzed and are reduced by constructing the dynamical hierarchical distance structure elements.
AB - Voronoi diagram is a basic data structure in geometry. It has been increasingly attracting the investigation into diverse applications since it was introduced into GIS field. Most current methods for computing Voronoi diagrams are implemented in vector mode. However, the vector-based methods are good only for points and difficult for complex objects. At the same time, most current raster methods are implemented only in a uniformed-grid raster mode. There is a lack of hierarchical method implemented in a hierarchical space such as quadtrees. In this paper such a hierarchical method is described for computing generalized Voronoi diagrams by means of hierarchical distance transform and hierarchical morphological operators based on the quadtree structure. Three different solutions are described and illustrated with experiments for different applications. Furthermore, the errors caused by this method are analyzed and are reduced by constructing the dynamical hierarchical distance structure elements.
UR - http://www.scopus.com/inward/record.url?scp=45449107913&partnerID=8YFLogxK
M3 - Conference article published in proceeding or book
SN - 3540435948
SN - 9783540435945
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 1004
EP - 1013
BT - Computational Science, ICCS 2002 - International Conference, Proceedings
T2 - International Conference on Computational Science, ICCS 2002
Y2 - 21 April 2002 through 24 April 2002
ER -