Linear-time triangulation of a simple polygon made easier via randomization
From MaRDI portal
Publication:5361531
DOI10.1145/336154.336206zbMath1374.68635MaRDI 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
52B55: Computational aspects related to convexity
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68W20: Randomized algorithms
Related Items
Computing hereditary convex structures, Approximate convex decomposition of polygons, Fast grid-free surface tracking