摘要
在已有算法基础上,利用动态辅助矩形,通过局部更新实现了任意位置、任意顺序的动态增删点的二维Delaunay三角剖分,同时给出了详细的数据结构和算法步骤,并在Visual C++6.0环境下实现了该算法.算法思路简捷,易于编程,生成的三角网形态优良,符合Delaunay三角形的性质.
The dynamical auxiliary rectangle is used to realize two-dimensional Delaunay triangulation for dynamic points addition and deletion at any position and any order through local updating based on existing algorithms.Furthermore,the data structures and procedures of the algorithm are described in detail.And the algorithm has been realized in Visual C＋＋ 6.0.This algorithm is concise and easy to program.Moreover,the triangulation generated is in good shape and accords with the Delaunay features.
出处
《兰州交通大学学报》
CAS
2010年第6期161-165,共5页
Journal of Lanzhou Jiaotong University
基金
教育部新世纪优秀人才支持计划(NCET-07-0404)
