A constrained growth algorithm of simple polygon triangulation is proposed.

提出了一种简单多边形三角剖分的约束生长算法.

互联网

Decomposing a simple polygon into convex cell is one of elementary problems of computational geometry.

摘要简单多边形凸单元剖分是计算几何的基本问题之一,剖分算法在许多领域均有较广泛的应用.

互联网

Meanwhile, the sufficient and necessary condition for the orientation of an arbitrary simple polygon is given.

同时, 给出了任意简单多边形走向的充要条件.

互联网