A near-linear time guaranteed algorithm for digital curve simplification under the Fréchet distance

Softcover, ISBN 978-3-642-19866-3International audienceGiven 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