Abstract
We present a simple and practical (1+\eps)-approximation algorithm for the Frechet distance between polygonal curves. To analyze this algorithm we introduce a new realistic family of curves, c-packed curves, that is closed under simplification. We believe the notion of c-packed curves to be of independent interest. We show that our algorithm has near linear running time for c-packed polygonal curves in Rd, and show similar results for other input models, such as low density.
Original language | English |
---|---|
Title of host publication | Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, Utah, USA, June 13-16, 2010 |
Editors | J. Snoeyink, M. de Berg, J.S.B. Mitchell, G. Rote, M. Teillaud |
Publisher | Association for Computing Machinery |
Pages | 365-374 |
Number of pages | 10 |
Publication status | Published - 13 Jun 2010 |