欢迎访问《图学学报》 分享到:

图学学报

• 几何设计与计算 • 上一篇    下一篇

增删点后的Voronoi 图生成算法

  

  • 出版日期:2013-02-27 发布日期:2015-06-10

The generating algorithm of Voronoi after adding and deleting points

  • Online:2013-02-27 Published:2015-06-10

摘要: Voronoi 图可广泛应用于模式识别、计算机图形学、计算机辅助设计、地
理信息系统等领域。利用Voronoi 图及其对偶图Delaunay 三角网构建的不规则三角网TIN
能充分地反映地形地貌特征,对TIN 的统一管理和动态调用可较好地应用到数字高程模型
的建立中。通过联机增量和减量算法来来实现增删点后的Voronoi 图的生成,具有能够动态
修改点集、速度快、效率高等优势。

关键词: Voronoi 图, 联机增量算法, 减量算法, 不规则三角网, 数字地面模型

Abstract: Voronoi is also called Thiessen polygon, which is a continuous polygon made of
perpendicular bisectors by joining the two adjacent points. It is widely used in pattern
recognition, computer graphics, computer aided design, geography information system and
many other fields. A new approach of constructing TIN that represented terrain well was given
based on Voronoi diagrams and Delaunay triangulation networks. It is easily to make full use of
the management and loading of TIN in the establishment of DEM. The method of online
incremental and reducing algorithm to realize the generation of Voronoi after adding and
deleting points can change points actively, and it holds the superiorities of fast speed and high
efficiency.

Key words: Voronoi, Online adding algorithm, Deleting algorithm, TIN, DTM