A fast las vegas algorithm for triangulating a simple polygon

1989/10/01 by Kenneth L. Clarkson, Robert E. Tarjan, Christopher J. Van Wyk · 4 citations
Computer Science · Engineering · Mathematics · #3D Shape Modeling and Analysis #Algorithm #Combinatorics #Computational Geometry and Mesh Generation #Computer science #Convex set #Data Management and Algorithms #Geometry #Las vegas #Mathematics #Polygon (computer graphics) #Polygon covering #Randomized algorithm #Regular polygon #SIMPLE algorithm #Simple (philosophy) #Simple polygon #Star-shaped polygon

paper · pdf · doi:10.1007/bf02187741

crossref issued 1989/10/01 · crossref published 1989/10/01 · crossref published-online 1989/10/01 · crossref published-print 1989/10/01 · openalex publication_date 1989/10/01 · crossref created 2005/09/20 · crossref deposited 2020/04/09 · openalex created_date 2025/10/10 · crossref indexed 2026/01/30 · openalex updated_date 2026/07/23

Citations

• An O(nlog log n)-Time Algorithm for Triangulating a Simple Polygon

Cited by

• A Randomized Algorithm for Triangulating a Simple Polygon in Linear Time
• A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons
• Triangulating a simple polygon in linear time
• Polygon triangulation [wikipedia]