Computing the Fréchet distance between piecewise smooth curves

Authors:
Günter Rote
Affiliations:
Freie Universität Berlin, Institut für Informatik, Takustraße 9, 14195 Berlin, Germany
Venue:
Computational Geometry: Theory and Applications
Year:
2007

Citing 4
Cited 5

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Analytic properties of plane offset curves

Computer Aided Geometric Design
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Matching planar maps

Journal of Algorithms

Exact algorithms for partial curve matching via the Fréchet distance

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SteerBug: an interactive framework for specifying and detecting steering behaviors

Proceedings of the 2009 ACM SIGGRAPH/Eurographics Symposium on Computer Animation
Fréchet-Distance on road networks

CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Accentuating focus maps via partial schematization

Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Boundary reconstruction in binary images using splines

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the Frechet distance between two curves which are given as a sequence of m+n curved pieces. If these pieces are sufficiently well-behaved, we can compute the Frechet distance in O(mnlog(mn)) time. The decision version of the problem can be solved in O(mn) time. The results are based on an analysis of the possible intersection patterns between circles and arcs of bounded curvature.