一种平面区域散乱点集的三角剖分方法  

A triangulation algorithm for scatted points in planar regions

作　　者：陈慧群[1] 

机构地区：[1]汕头大学机械电子工程系,广东汕头515063

出　　处：《机械》2006年第S1期59-60,共2页Machinery

摘　　要：基于 Delaunay 三角化技术,提出一种对任意平面区域生成三角网格的全自动生成算法。此算法具有运行快速,构造网格质量好、区域适应性强等优点。算法包括对散乱数据点排序、三角剖分及网格优化处理等,最后给出的实例也证明了该算法的可靠性和实用性。Based on the Delaunay triangulation method,an automatic triangulation mesh generation algorithm for arbitrarily planar regions is presented;this algorithm has the advantage of fast operation,adaptation to complicate boundaries,high quality mesh.The algorithm includes rank of scattered points,triangulation and mesh optimization;At last,an example is given to demonstrate the reliability and practicability of this algorithm.

关 键 词：平面区域 散乱点纂 DELAUNAY 三角剖分 

分 类 号：TP391.7[自动化与计算机技术—计算机应用技术]