Geodesic-preserving polygon simplification

DOI10.1007/978-3-642-45030-3_2zbMATH Open1329.68256OpenAlexW3136448411MaRDI QIDQ2872066FDOQ2872066

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (7)

• Geodesic-preserving polygon simplification
• Title not available (Why is that?)
• 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
• Ham-sandwich cuts for abstract order types
• Polygon simplification by minimizing convex corners

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)