摘要： 本文以Lawson最小内角最大的三角化原则为基础,提出了一种能够处理平面任意不规则区域内散乱点的自动三角化算法。

关键词: 散乱点, 三角化, 边界环, 特征线

Abstract: Based on Lawson's max-min angle criterion of triangulation and the definitions of boundary edge and feature line, some known algorithm conditions that define a triangle are discussed and a new algorithm of triangulation for irregular points in non-convex polygon is put forward.