It can be usedto treat arbitrary sample polygonal domains. it is easy for the algorithm to be extensively applied to complexly nested domains (Zhang Liang et al).

• 该算法基于贪心法平面点集的三角剖分,可以处理任意简单多边形区域(有若干孔或无孔的凸、凹多边形区域),并且极易推广应用到区域嵌套组合等复杂情形。