Place the Vertices Anywhere on the Curve and Simplify

DOI10.3233/FI-2021-2041OpenAlexW3174005235MaRDI QIDQ5164876

Ali Gholami Rudi

Publication date: 15 November 2021

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2021-2041

zbMATH Keywords

geometric algorithmscomputational geometrycurve simplification

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Near-linear time approximation algorithms for curve simplification
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Optimal simplification of polygonal chain for rendering
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Global Curve Simplification
• On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance
• Polyline simplification has cubic complexity
• Streaming algorithms for line simplification

This page was built for publication: Place the Vertices Anywhere on the Curve and Simplify