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

Triangulating a simple polygon in linear time

Bernard Chazelle · Discrete & Computational Geometry · 1991 · 636 citations · Full text

Computing, Computer Science, Algorithms +15

Triangulating a simple polygon

M. R. Garey, David S. Johnson, Franco P. Preparata et al. · Information Processing Letters · 1978 · 299 citations

Computing, Computer Science, Computational Geometry +9

A theorem on polygon cutting with applications

Bernard Chazelle · 1982 · 268 citations

Computing, Computer Science, Mathematics +16

Triangulating Simple Polygons and Equivalent Problems

Alain Fournier, Delfin Y. Montuno · ACM Transactions on Graphics · 1984 · 202 citations · Full text

Computing, Computer Science, Computational Geometry +8

An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon

Robert E. Tarjan, Christopher J. Van Wyk · SIAM Journal on Computing · 1988 · 158 citations

Computing, Computer Science, Mathematics +13