simple polygon

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

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

Secondly, the approximate medial axis of the simple polygon consisting of line segments is computed. At last, the author analysis the axis how to been used in urban design, combining the axle wire designing in Beijing.

我们首先通过交互获取物体二维轮廓线，然后抽取二维形状的近似中轴线。最后结合北京中轴线的设计分析轴线在城市规划中的应用。

Self-adapting Scanning Beam Algorithm for Filling Core of Simple Polygon

自适应扫描线的简单多边形核填充算法

A constrained growth algorithm of simple polygon triangulation is proposed.

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

They are as follow, an optimal algorithm for determining the convex hull of a finite planar point set, an algorithm for triangulation of planar point-set in O ( nlogn) time, the fast algorithm for Delaunay triangulation of simple polygon based on maximum triangle weights.

它们分别是求平面点集凸壳的格雷厄姆方法的一个改进算法，一种时间复杂度为O（nlogn）的平面点集三角剖分算法和简单多边形快速Delaunay三角剖分算法。