Linear Time Triangulation of Simple Polygons

@inproceedings{Boyd2009LinearTT,
  title={Linear Time Triangulation of Simple Polygons},
  author={Landon Boyd},
  year={2009}
}
From the early days of computational geometry, practitioners have looked for faster ways to triangulate a simple polygon. Several near-linear time algorithms have been devised and implemented. However, the true linear time algorithms of Chazelle and Amato et al. are considered impractical for actual use despite their faster asymptotic running time. In this paper, I examine the latter of these in detail and attempt to implement it. 

References

Publications referenced by this paper.
SHOWING 1-10 OF 14 REFERENCES

A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons

R. Seidel
  • Comput. Geom. Theory Appl., 1(1):51–64
  • 1991
VIEW 3 EXCERPTS
HIGHLY INFLUENTIAL

Cs633: Final project

G. E. Keay
  • http: //citeseerx.ist.psu.edu/viewdoc/download?doi= 10.1.1.115.8880&rep=rep1&type=pdf
  • 2007
VIEW 1 EXCERPT

Triangulations and Mesh Generation

  • Handbook of Discrete and Computational Geometry, 2nd Ed.
  • 2004
VIEW 1 EXCERPT

Triangulating a simple polygon in linear time

  • Discrete & Computational Geometry
  • 1991
VIEW 2 EXCERPTS