A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Frechet Distance

摘要

Given a digital curve and a maximum error, we propose an algorithm that computes a simplification of the curve such that the Frechet distance between the original and the simplified curve is less than the error. The algorithm uses an approximation of the Frechet 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.