摘要
针对在文献[1]中提出的边界边、边界面片在Delaunay三角化中的存在条件的3个 命题，给出了采用Voronoi图和邻域的概念的证明过程。并在此基础上，给出了约束Delaun a y三角化的实现算法，进一步丰富了Delaunay三角化的理论基础。
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.
出处
《计算机工程》
CAS
CSCD
北大核心
2003年第3期33-34,共2页
Computer Engineering
