论文信息 - Fréchet-Distance on Road Networks

Fréchet-Distance on Road Networks

As a measure for the resemblance of tracks in a network graph, we consider the so-called Freechet-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 Freechet-distance between P and Q is developed. Then some important variants are investigated, namely weak Freechet distance, discrete Freechet distance , all based on the network distance.

Jun Luo | Binhai Zhu | Chenglin Fan

[1] Kevin Buchin,et al. Computing the Fréchet distance between simple polygons , 2008, Comput. Geom..

[2] Richard Cole,et al. Slowing down sorting networks to obtain faster sorting algorithms , 2015, JACM.

[3] Günter Rote. Computing the Fréchet distance between piecewise smooth curves , 2007, Comput. Geom..

[4] Philip N. Klein,et al. Faster Shortest-Path Algorithms for Planar Graphs , 1997, J. Comput. Syst. Sci..

[5] Günter Rote,et al. Matching planar maps , 2003, SODA '03.

[6] Helmut Alt,et al. Computing the Fréchet distance between two polygonal curves , 1995, Int. J. Comput. Geom. Appl..

[7] Maike Buchin,et al. Semi-computability of the Fréchet distance between surfaces , 2005, EuroCG.

[8] Dieter Pfoser,et al. On Map-Matching Vehicle Tracking Data , 2005, VLDB.

[9] Nimrod Megiddo,et al. Applying parallel computation algorithms in the design of serial algorithms , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).