Fast Triangulation of Simple Polygons

We present a new algorithm for triangulating simple polygons that has four advantages over previous solutions [GJPT, Ch].

[1]  Franco P. Preparata,et al.  Location of a Point in a Planar Subdivision and Its Applications , 1977, SIAM J. Comput..

[2]  Thomas Ottmann,et al.  Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.

[3]  Robert E. Tarjan,et al.  Application of a Planar Separator Theorem , 1977, FOCS.

[4]  Franco P. Preparata,et al.  Plane-sweep algorithms for intersecting geometric figures , 1982, CACM.

[5]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[6]  Michael Ian Shamos,et al.  Geometric complexity , 1975, STOC.

[7]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..