【摘要】 约束生长算法是生长算法的一个扩展,将两者结合可实现任意数据域的Delaunay三角剖分。提出了一种简单多边形三角剖分的约束生长算法。该算法的思想是基于生长算法,基边向外扩展时,增加了2个约束条件,算法思路简单,易于编程实现,且生成的三角网是Delaunay三角网。更多还原

【Abstract】 Constrained growth algorithm is an expansion of growth algorithm,Delaunay triangulating on random data domains can be realized by combining both. A constraind growth algorithm of simple polygon triangulation is proposed. Its basic idea is based on the growth algorithm,when its basic edge is expanded toward outside,2 constrained conditions are considered. Its clue is clear and simple for programming,generated triangulation is a Delaunay one.更多还原