Linear-time Polygon Triangulation Algorithm

Polygon triangulation, a classic problem in Computational
Geometry, has been studied since the late 70's. Among the
many results, Chazelle's linear-time algorithm, published
in 1991, is most noteworthy. In this talk, I will give a
high-level overview of Chazelle's algorithm and dicsuss
its main building blocks.