A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
From MaRDI portal
Publication:3000715
DOI10.1007/978-3-642-19867-0_28zbMath1272.52030OpenAlexW2137569145MaRDI QIDQ3000715
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
Analysis of algorithms and problem complexity (68Q25) Computational aspects related to convexity (52B55) Approximation by convex sets (52A27)
Related Items (1)
This page was built for publication: A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance