This Gem describes an implementation based on Seidel's algorithm ( op. cit. ) for triangulating simple polygons having no holes (The code has since then been extended to handle holes) . It is an incremental randomized algorithm whose expected complexity is O(n log*n) .这种宝石介绍一个实现基于赛德尔的算法扩展到处理孔)(同当时已见。)可以简单多边形三角无孔(代码至今 。这是一个渐进的随机算法,其预期的复杂性为O(n日志* N)的 。 In practice, it is almost linear time for a simple polygon having n vertices.在实践中,它几乎是n个顶点的线性时间,有一个简单的多边形。 The triangulation does not introduce any additional vertices and decomposes the polygon into n-2 triangles.三角测量不引入任何额外的顶点和三角形,多边形分解成 n - 2。Furthermore, the algorithm generates a query structure that can be used to determine the location of a point in logarithmic time.此外,该算法生成一个查询的结构,可用于确定时间地点对数点研究。 Related gems include incremental Delaunay triangulation of a set of points [Lischinski 1994] and polygonization of implicit surfaces [Bloomenthal 1994] .有关宝石包括增量Delaunay三角点的一组[Lischinski 1994]和曲面多边形的隐[Bloomenthal 1994] 。