基于平面凹多边形域的快速约束Delaunay三角化  

On the Quick Constrained Delaunay Triangulation Base on the Plane Concave Polygon

作　　者：李新[1] 

机构地区：[1]无锡南洋职业技术学院建筑工程系

出　　处：《无锡南洋职业技术学院论丛》2011年第2期46-49,共4页Journal of Wuxi South Ocean College

摘　　要：由平面凹多边形域相对于凸多边形域构建Delaunay三角网时的特殊性,针对平面凹多边形域,提出一种快速生成约束Delaunay三角网的算法,该方法是在生成每个三角形的过程中就加入约束条件,以充分保证所生成的三角形与凹多边形域不会相交,从而不必对初始三角网优化就可一次达到目的,有效减少了构网时间,提高了构网速度。Compared with the convex polygon,the plane concave polygon has its specific characteristics when constructing the Delaunay triangulation network.This paper proposes a quick method to form the constrained Delaunay triangulation,which adds constrained condition to the process forming each triangle.This method fully ensures that the formed triangles will not intersect with the plane concave polygon,which needs no majorization to the primary triangulation network while achieve the aim once.Because of this,the net construction time is reduced and speed is increased.

关 键 词：平面凹多边形域 约束DELAUNAY三角化 

分 类 号：P20[天文地球—测绘科学与技术]