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

DOI10.1016/j.comgeo.2010.03.003zbMath1192.65027OpenAlexW2153980854MaRDI QIDQ982944

Raimund Seidel

Publication date: 28 July 2010

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2010.03.003

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (1)

Trapezoidal diagrams, upward triangulations, and prime Catalan numbers

Cites Work

• Unnamed Item
• Triangulating a simple polygon
• A fast Las Vegas algorithm for triangulating a simple polygon
• Triangulation and shape-complexity
• Triangulating Simple Polygons and Equivalent Problems
• An $O(n\log \log n)$-Time Algorithm for Triangulating a Simple Polygon
• ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
• Sorting jordan sequences in linear time using level-linked search trees

This page was built for publication: Reprint of: A simple and fast incremental randomized algorithm for computing trapezoidal decompositions and for triangulating polygons