Linear-time triangulation of a simple polygon made easier via randomization

DOI10.1145/336154.336206zbMath1374.68635OpenAlexW2027440570MaRDI QIDQ5361531

Nancy M. Amato, Michael T. Goodrich, Edgar A. Ramos

Publication date: 29 September 2017

Published in: Proceedings of the sixteenth annual symposium on Computational geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/336154.336206

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Randomized algorithms (68W20)

Related Items (3)

Computing hereditary convex structures ⋮ Approximate convex decomposition of polygons ⋮ Fast grid-free surface tracking

This page was built for publication: Linear-time triangulation of a simple polygon made easier via randomization