A raster Voronoi diagram generation algorithm based on horizontal-longitudinal scanning

被引：0
|
作者：
Liu Q. [1 ]
Zhao X. [1 ]
Wang L. [2 ]
Sun W. [1 ]
机构：
[1] College of Geoscience and Surveying Engineering, China University of Mining and Technology (Beijing), Beijing
[2] School of Surveying and Land Information Engineering Henan Polytechnic University, Jiaozuo
来源：
Cehui Xuebao/Acta Geodaetica et Cartographica Sinica | 2019年 / 48卷 / 03期
基金：
中国国家自然科学基金;
关键词：
Raster distance; Raster scan; Voronoi diagram;
D O I：
10.11947/j.AGCS.2019.20180088
中图分类号：
学科分类号：
摘要：
The Voronoi diagram is an important data structure in computational geometry and has a wide range of applications in many fields. The scan algorithm of raster is an optimization of the Euclidean distance algorithm, which is in line with the discrete features of computers. It is one of the optimal algorithms for the generation of raster Voronoi diagram. However, due to the difference between the grid distance and the Euclidean distance, the ownership of some grids in the scanning process inevitably has some errors, so that the application of the raster Voronoi diagram is limited. In this paper, according to the characteristics of error existing in traditional scanning algorithms, an improved algorithm for the generation of raster Voronoi diagram based on horizontal-longitudinal scanning is proposed. First of all, the causes and the regional distribution characteristics of defects of the traditional scanning algorithm are analyzed in depth. Then, using the 3×3 neighborhood as a template, a vertical scan is added after a horizontal scan. That is to say, the Voronoi diagram can be generated accurately by horizontal and vertical scanning. Finally, different raster data are used to carry out experimental comparison. The results show that the improved algorithm not only has the advantage of efficiency of scanning algorithm, but also solves the error of the original algorithm. It keeps the efficiency while limiting the error to a grid. © 2019, Surveying and Mapping Press. All right reserved.
引用
收藏
页码：393 / 399
页数：6
相关论文
共 26 条
  • [1] Zhou P., Computational Geometry: Algorithm Analysis and Design, (2000)
  • [2] Prepalata F.P., Shamos M.I., Computational Geometry, (1990)
  • [3] Liu X., Wu Y., Hu H., A method of extracting multiscale skeletons for polygonal shapes, Acta Geodaetica et Cartographica Sinica, 42, 4, pp. 588-594, (2013)
  • [4] Zhang W., Research on medical visualization of human color image segmentation technology, (2005)
  • [5] Lu X., Research on route planning and formation control method for multi aircraft cooperative, (2014)
  • [6] Kastrisios C., Tsoulos L., A cohesive methodology for the delimitation of maritime zones and boundaries, Ocean & Coastal Management, 130, pp. 188-195, (2016)
  • [7] Shamos M.I., Hoey D., Closest-point problems, Proceedings of the 16th Annual Symposium on Foundations of Computer Science, pp. 151-162, (1977)
  • [8] Green P.J., Sibson R., Computing dirichlet tessellations in the plane, The Computer Journal, 21, 2, pp. 168-173, (1978)
  • [9] Fortune S., A sweepline algorithm for voronoi diagrams, Algorithmica, 2, 1-4, pp. 153-174, (1987)
  • [10] Brown K.Q., Geometric transforms for fast geometric algorithms, (1979)
123