Simplifying a polygonal subdivision while keeping it simple

DOI10.1145/378583.378612zbMath1377.68272OpenAlexW2025357196MaRDI QIDQ5361557

Regina Estkowski, Joseph S. B. Mitchell

Publication date: 29 September 2017

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

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (7)

Area-preserving approximations of polygonal paths ⋮ Shortcut hulls: vertex-restricted outer simplifications of polygons ⋮ Computing homotopic line simplification ⋮ Polygonal chain approximation: A query based approach ⋮ Unnamed Item ⋮ On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance ⋮ Polygonal path simplification with angle constraints

This page was built for publication: Simplifying a polygonal subdivision while keeping it simple