Fréchet-Distance on road networks

Authors:
Chenglin Fan;Jun Luo;Binhai Zhu
Affiliations:
Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China;Shenzhen Institutes of Advanced Technology, Chinese Academy of Sciences, Shenzhen, China;Department of Computer Science, Montana State University, Bozeman
Venue:
CGGA'10 Proceedings of the 9th international conference on Computational Geometry, Graphs and Applications
Year:
2010

Citing 7
Cited 0

Slowing down sorting networks to obtain faster sorting algorithms

Journal of the ACM (JACM)
Faster shortest-path algorithms for planar graphs

STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Applying Parallel Computation Algorithms in the Design of Serial Algorithms

Journal of the ACM (JACM)
Matching planar maps

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
On map-matching vehicle tracking data

VLDB '05 Proceedings of the 31st international conference on Very large data bases
Computing the Fréchet distance between piecewise smooth curves

Computational Geometry: Theory and Applications
Computing the Fréchet distance between simple polygons

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

As a measure for the resemblance of tracks in a network graph, we consider the so-called Fréechet-distance based on network distance. For paths P and Q consisting of p and q consecutive edges, an O((p2+q2)logpq) time algorithm measuring the Fréechet-distance between P and Q is developed. Then some important variants are investigated, namely weak Fréechet distance, discrete Fréechet distance , all based on the network distance.