A natural metric for curves—computing the distance for polygonal chains and approximation algorithms
STACS 91 Proceedings of the 8th annual symposium on Theoretical aspects of computer science
Approximation of Polygonal Curves with Minimum Number of Line Segments
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Streaming algorithms for line simplification
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Fréchet Distance Based Approach for Searching Online Handwritten Documents
ICDAR '07 Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01
Optimal simplification of polygonal chains for subpixel-accurate rendering
Computational Geometry: Theory and Applications
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
A combined multi-scale/irregular algorithm for the vectorization of noisy digital contours
Computer Vision and Image Understanding
| Hi-index | 0.00 |
Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Fréchet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Fréchet distance, but a guarantee over the quality of the simplification is proved. Moreover, even if the theoretical complexity of the algorithm is in O(n log(n)), experiments show a linear behaviour in practice.