一种循环消除顶点的平面多边形三角剖分算法

An Arithmetic of the Partition in Plane Polygon by the Triangle to Eliminate the Vertex in a Circling Way

概述了平面多边形三角形剖分的各种算法,提出了一种不考虑多边形的凸凹性、顶点顺时针或逆时针走向循环消除顶点的平面多边形三角剖分算法,并给出了实例.

The diversified arithmetics of the partition in plane polygon by the triangle are summarized. We have proposed an arithmetic of this kind to eliminate the vertex in a circling way, ignoring the knaggy character and the deasil or anticlockwise direction of the plane polygon. Several samples are given.