Triangulating a Simple Polygon in Linear Time

  title={Triangulating a Simple Polygon in Linear Time},
  author={Bernard Chazelle},
  journal={Discrete & Computational Geometry},
Triangulating a simple polygon has been one of the most outstanding open problems in two-dimensional computational geometry. It is a basic primitive in computer graphics and, generally, seems the natural preprocessing step for most nontrivial operations on simple polygons [5,13]. Recall that to triangulate a polygon is t o partition it into triangles without adding any new vertices. Despite its apparent simplicity, however, the triangulation problem has remained elusive. In 1978, Garey et al… CONTINUE READING


Publications referenced by this paper.
Showing 1-10 of 21 references

( nlog 1 ogn ) polygon triangulation with simple data structures , Proc . 6 th Ann

  • D. G. Kirkpatrick, M. M. Klawe, R. E. O Tarjan
  • ACM Symp . Comput . Geom .
  • 1990

Fast algorithms for some problems on trees and gmphs

  • H. Booth, R. E. Tarjan
  • 1990

A fast Lus Vegas algorithm for triangulating a simple polygon , Disc .

  • K. Clarkson, R. E. Tarjan, C. J. Van Wyk
  • and Comput . Geom .
  • 1989

A linear time algorithm for minimum link paths inside a simple polygon

  • S. Suri
  • J . Comput . Vision Graphics and Image Process
  • 1986

Similar Papers

Loading similar papers…