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

DOI10.1016/J.COMGEO.2010.03.003MaRDI QIDQ982944zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• A fast Las Vegas algorithm for triangulating a simple polygon
• An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon
• ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"
• scientific article; zbMATH DE number 3825165 (Why is no real title available?)
• Sorting jordan sequences in linear time using level-linked search trees
• Triangulating a simple polygon
• Triangulating Simple Polygons and Equivalent Problems
• Triangulation and shape-complexity

Cited in

(2)

• Trapezoidal diagrams, upward triangulations, and prime Catalan numbers
• Partial order multiway search

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q982944)