Direct Algorithm for the Exact Voronoi Diagram on Discrete Topographic Space

被引：0
|
作者：
Duan X. [1 ,2 ,3 ]
Ge Y. [3 ,4 ]
Zhang T. [5 ]
Li L. [6 ,7 ]
Tan Y. [1 ,3 ]
机构：
[1] School of Surveying and Geoinformation Engineering, East China University of Technology, Nanchang
[2] State Key Laboratory of Resources and Environmental Information System, Beijing
[3] Key Laboratory of Mine Environmental Monitoring and Improving Around Poyang Lake, Ministry of Natural Resources, Nanchang
[4] University of Chinese Academy of Sciences, Beijing
[5] State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan
[6] School of Resources and Environmental Sciences, Wuhan University, Wuhan
[7] Geospatial Information Technology Collaborative Innovation Center, Wuhan University, Wuhan
来源：
Wuhan Daxue Xuebao (Xinxi Kexue Ban)/Geomatics and Information Science of Wuhan University | 2023年 / 48卷 / 05期
关键词：
geodesic distance field; geodesic Voronoi diagram; hyperbolic arrangement; singular growth; topographic space;
D O I：
10.13203/j.whugis20210566
中图分类号：
学科分类号：
摘要：
Objectives: Voronoi diagram is a fundamental structure in geo-computing, but it still encounters the problem of exactness and the challenge of an exact algorithm comparable to planar Voronoi diagrams in the topographic space. Methods: The geodesic distance field of computational geometry is introduced into the triangulated irregular network in the discrete topographic surface. The hyperbolic curves representing the bisector are gradually grown from the singularity of the distance field on the edge of the grid. The precise division of the discrete surface is obtained by the arrangement of the hyperbolic curves, and the exact geodesic Voronoi diagram (GVD) is obtained by clustering the divided patches. Then, the exact Voronoi diagrams are tested quantitatively and qualitatively. Results and Conclusions: It is found that the exact GVD can bring a basic improvement for the spatial analysis of topographic surface. The direct algorithm based on singular growth and hyperbolic arrangement is intuitive and easy to implement, which avoids the excessive subdivision and preprocessing of grid patches by the existing algorithms, and provides a useful exploration for the development of Voronoi diagram analysis in digital topographic analysis. © 2023 Wuhan University. All rights reserved.
引用
收藏
页码：799 / 806
页数：7
相关论文
共 37 条
  • [1] Jun Chen, Renliang Zhao, Chaofei Qiao, Voronoi Diagram-Based GIS Spatial Analysis［J］, Geomatics and Information Science of Wuhan University, 28, pp. 32-37, (2003)
  • [2] Renzhong Guo, Spatial Analysis ［M］, (2001)
  • [3] Xuesheng Zhao, Jun Chen, Jinzhuang Wang, QTM-Based Algorithm for the Generating of Voronoi Diagram for Spherical Objects［J］, Acta Geodaetica et Cartographic Sinica, 31, 2, pp. 157-163, (2002)
  • [4] Hu H, Hu P., Voronoi Diagram Generation on the Ellipsoidal Earth［J］, Computers & Geosciences, 73, pp. 81-87, (2014)
  • [5] Okabe A., Spatial Tessellations ：Concepts and Applications of Voronoi Diagrams［M］, (2000)
  • [6] Shi W Z，, Pang M Y C., Development of Voronoi-Based Cellular Automata：An Integrated Dynamic Model for Geographical Information Systems ［J］, International Journal of Geographical Information Science, 14, 5, pp. 455-474, (2000)
  • [7] Peng Hu, Haijun Wang, Chunli Shao, Et al., Polygon Medial Axis Problem and the Algorithm［J］, Geomatics and Information Science of Wuhan University, 30, 10, pp. 853-857, (2005)
  • [8] Adikusuma Y Y，, Fang Z，, He Y., Fast Construction of Discrete Geodesic Graphs［J］, ACM Transactions on Graphics, 39, 2, (2020)
  • [9] Junli Zhao, Shiqing Xin, Yongjin Liu, Et al., A Survey on the Computing of Geodesic Distances on Meshes［J］, Scientia Sinica Informationis, 45, 3, pp. 313-335, (2015)
  • [10] Jing Shen, Jiping Liu, Xiangguo Lin, Et al., A Method for Delaunay Triangulation by Integration of Distance Transformation and Region Adjacency Graphics［J］, Geomatics and Information Science of Wuhan University, 37, 8, pp. 1000-1003, (2012)
1234