Abstract:
The prerequisites for the legal existence of boundary edge and bound ary patch in Delaunay triangulation,which is put forward in reference [1],has been proved by exploiting the concept of Voronoi diagram and neighborhood in t hi s paper. The algorithm of constrained Delaunay triangulation is also designed an d implemented. The result further extends the theoretical basis of constrain ed D elaunay triangulation.
摘要: 针对在文献[1]中提出的边界边、边界面片在Delaunay三角化中的存在条件的3个 命题,给出了采用Voronoi图和邻域的概念的证明过程。并在此基础上,给出了约束Delaun a y三角化的实现算法,进一步丰富了Delaunay三角化的理论基础。
关键词:
数据域,
Delaunay三角化,
Voronoi图,
约束
CLC Number:
LI Haisheng1,2, YANG Qin2, CHEN Qiming2. Research and Algorithm of Constrained Delaunay Triangulation[J]. , 2003, 29(03): 37-38.
李海生,杨钦,陈其明. 约束Delaunay三角化的研究与实现[J]. , 2003, 29(03): 37-38.