Abstract
We consider the problem of approximating a polygonal curve P under a given error criterion by another polygonal curve P’ whose vertices are a subset of the vertices of P. The goal is to minimize the number of vertices of P’ while ensuring that the error between P’ and P is below a certain threshold. We consider two different error measures: Hausdorff and Frechet. For both error criteria, we present near-linear time approximation algorithms that, given a parameter ε > 0, compute a simplified polygonal curve P’ whose error is less than ε and size at most the size of an optimal simplified polygonal curve with error ε/2. We consider monotone curves in ℝ2 in the case of the Hausdorff error measure under the uniform distance metric and arbitrary curves in any dimension for the Frechet error measure under Lp metrics. We present experimental results demonstrating that our algorithms are simple and fast, and produce close to optimal simplifications in practice.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Agarwal, P., Har-Peled, S., Mustafa, N. et al. Near-Linear Time Approximation Algorithms for Curve Simplification. Algorithmica 42, 203–219 (2005). https://doi.org/10.1007/s00453-005-1165-y
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00453-005-1165-y