Abstract
We introduce a new distance measure for directed curves in ℝd, called the direction-based Fréchet distance. Like the standard Fréchet distance, this measure optimizes over all parameterizations for a pair of curves. Unlike the Fréchet distance, it is based on differences between the directions of movement along the curves, rather than on positional differences. Hence, the direction-based Fréchet distance is invariant under translations and scalings. We describe efficient algorithms to compute several variants of the direction-based Fréchet distance, and we present an applet that can be used to compare the direction-based Fréchet distance with the traditional Fréchet distance.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Alt, H., Godau, M.: Computing the Fréchet distance between two polygonal curves. International Journal of Computational Geometry & Applications 5, 75–91 (1995)
Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the Fréchet distance. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 63–74. Springer, Heidelberg (2001)
Apaydin, T., Ferhatosmanoglu, H.: Access structures for angular similarity queries. IEEE Transactions on Knowledge and Data Engineering 18(11), 1512–1525 (2006)
Arkin, E.M., Chew, L., Huttenlocher, D., Kedem, K., Mitchell, J.: An efficiently computable metric for comparing polygonal shapes. In: 1st Symposium on Discrete Algorithms (SODA), pp. 129–137 (1990)
Buchin, K., Buchin, M., Gudmundsson, J.: Constrained free space diagrams: a tool for trajectory analysis. Int. J. of Geographical Information Science 24(7), 1101–1125 (2010)
Buchin, K., Buchin, M., Wang, Y.: Exact algorithms for partial curve matching via the Fréchet distance. In: 20th Symposium on Discrete Algorithms (SODA), pp. 645–654 (2009)
Buchin, M.: On the computability of the Fréchet distance between triangulated surfaces. Dissertation, Freie Universität Berlin (2007)
Cohen, S., Guibas, L.: Partial matching of planar polylines under similarity transformations. In: 8th Symposium on Discrete Algorithms (SODA), pp. 777–786 (1997)
Efrat, A., Fan, Q., Venkatasubramanian, S.: Curve matching, time warping, and light fields: New algorithms for computing similarity between curves. Journal of Mathematical Imaging and Vision (2007)
Kolodny, R., Koehl, P., Levitt, M.: Comprehensive evaluation of protein structure alignment: Scoring by geometric measures. J. of Molecular Biology 346, 1173–1188 (2005)
Li, H., Shen, I.: Similarity measure for vector field learning. In: Wang, J., et al. (eds.) ISNN 2006. LNCS, vol. 3971, pp. 436–441. Springer, Heidelberg (2006)
Maheshwari, A., Sack, J.R., Shahbaz, K.: Computing Fréchet distance with speed limits. In: 21st Canadian Conf. on Computational Geometry (CCCG), pp. 107–110 (2009)
Veltkamp, R.C.: Shape matching: Similarity measures and algorithms. Shape Modeling and Applications, 188–197 (2001)
Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: Localizing global curve-matching algorithms. In: 18th Conference on Scientific and Statistical Database Management (SSDBM), pp. 379–388 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M., Cook, A.F. (2011). Go with the Flow: The Direction-Based Fréchet Distance of Polygonal Curves. In: Marchetti-Spaccamela, A., Segal, M. (eds) Theory and Practice of Algorithms in (Computer) Systems. TAPAS 2011. Lecture Notes in Computer Science, vol 6595. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-19754-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-19754-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-19753-6
Online ISBN: 978-3-642-19754-3
eBook Packages: Computer ScienceComputer Science (R0)