Geodesic-preserving polygon simplification

DOI10.1007/978-3-642-45030-3_2MaRDI QIDQ2872066zbMATH OpenOpenAlexFDO

Authors Oswin Aichholzer, Alexander Pilz, Birgit Vogtenhuber, T. Hackl, Matias Korman

Publication date 14 January 2014

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45030-3_2

Mathematics Subject Classification ID

Data structures (68P05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Geodesic-preserving polygon simplification
• Simplifying a polygonal subdivision while keeping it simple
• Polygonal path simplification with angle constraints

Cited in

(5)

• scientific article; zbMATH DE number 98471 (Why is no real title available?)
• Cartographic line simplication and polygon CSG formulae in \(O(n \log^* n)\) time
• On simplifying shapes by subjecting them to collinearity constraints
• Shortcut hulls: vertex-restricted outer simplifications of polygons
• Geodesic-preserving polygon simplification

This page was built for publication: Geodesic-preserving polygon simplification

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