Place the vertices anywhere on the curve and simplify

DOI10.3233/FI-2021-2041OpenAlexW3174005235MaRDI QIDQ5164876FDOQ5164876

Authors: 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

Recommendations

• SimpliPoly: curvature-based polygonal curve simplification
• Progressive simplification of polygonal curves
• scientific article; zbMATH DE number 1947379
• scientific article; zbMATH DE number 1070447
• Near-linear time approximation algorithms for curve simplification

zbMATH Keywords

computational geometrygeometric algorithmscurve simplification

Mathematics Subject Classification ID

Computer science (68-XX)

Cites Work

• Computational geometry. Algorithms and applications.
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Near-linear time approximation algorithms for curve simplification
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE
• Title not available (Why is that?)
• Cartographic line simplification and polygon CSG formulae in \(O(n\log^* n)\) time
• Optimal simplification of polygonal chain for rendering
• Polyline simplification has cubic complexity
• Global Curve Simplification
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Streaming algorithms for line simplification

Cited In (1)

• SimpliPoly: curvature-based polygonal curve simplification

This page was built for publication: Place the vertices anywhere on the curve and simplify

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