A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance

DOI10.1007/978-3-642-19867-0_28MaRDI QIDQ3000715zbMATH OpenOpenAlexFDO

Authors Isabelle Sivignon

Publication date 19 May 2011

Published in Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-19867-0_28

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Approximation by convex sets (52A27)

Recommendations

• scientific article; zbMATH DE number 1947379
• Near-linear time approximation algorithms for curve simplification
• Approximating the Fréchet distance for realistic curves in near linear time
• Approximating the Fréchet distance for realistic curves in near linear time
• An efficient algorithm for the optimal polygonal approximation of digitized curves
• An optimal algorithm for polygonal approximation of digitized curves
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• On optimal polyline simplification using the Hausdorff and Fréchet distance

Cited in

(6)

• Geometric preservation of 2D digital objects under rigid motions
• Approximating the Fréchet distance for realistic curves in near linear time
• scientific article; zbMATH DE number 1947379 (Why is no real title available?)
• On optimal polyline simplification using the Hausdorff and Fréchet distance
• Near-linear time approximation algorithms for curve simplification
• On optimal polyline simplification using the Hausdorff and Fréchet distance

This page was built for publication: A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance

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