摘要
基于Delaunay三角网划分的两个特性:最大最小特性与空外接圆特性,论文构网过程分三步:生成边界,构造内三角网,对边界与内三角网之间的空洞进行处理。具体实现过程:先通过边界点集构造边界,再在已生成的边界内,利用区域生长法思想,以及方差的方法对非边界点集进行插入,来构造内三角网,最后采用等比例划分方法处理边界与边界内三角网之间的空洞。实验表明,改进后,不需要对每次生成的边进行判断是否是边界边,插入的点是否是边界点的处理,避免了复杂构网的过程,并且快速实现了物体表面Delaunay三角网划分的目的。且上述方法简单、快捷,易于实现,经实验证明是行之有效的。
Based on the two features of the Delaunay triangulation：maximum and minimum feature,empty circumcircle feature,in this article the procedure of building triangulation network needs three steps：creating boundary,building up the interior triangulation network,coping with the hole between the boundary and the interior triangulation network.The detial process is that we can build up the boundary throught the boundary point set variance and aera growth-inserting the non-boundary points,at at first,then we can form the inside nework by the method of the last,we shall deal with the hole between the boundary and the interior network boundary in the method of equal proportion partition.After the improvement,we needn＇t judge the new born edges and the points are whether or not belonged to the boundary,and avoid the complex process,acquire the Delaunay triangulation surface of the object quickly.Experiment results demonstrate that the method proposed is simple and effective.
出处
《计算机工程与应用》
CSCD
北大核心
2009年第16期197-200,共4页
Computer Engineering and Applications
