Road network reconstruction for organizing paths

We consider the problem of reconstructing a road network from a collection of path traces and provide guarantees on the accuracy of the reconstruction under reasonable assumptions. Our algorithm can be used to process a collection of polygonal paths in the plane so that shared structures (subpaths) among the paths in the collection can be discovered and the collection can be organized to allow efficient path similarity queries against new query paths on the same road network. This is a timely problem, as GPS and other location traces of both people and vehicles are becoming available on a large scale and there is a real need to create appropriate data structures and data bases for such data.

[1]  Tamal K. Dey,et al.  Reconstructing curves with sharp corners , 2001, Comput. Geom..

[2]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[3]  Peter Weiner,et al.  Linear Pattern Matching Algorithms , 1973, SWAT.

[4]  Dieter Pfoser,et al.  Addressing the Need for Map-Matching Speed: Localizing Global Curve-Matching Algorithms , 2006, 18th International Conference on Scientific and Statistical Database Management (SSDBM'06).

[5]  Edward M. McCreight,et al.  A Space-Economical Suffix Tree Construction Algorithm , 1976, JACM.

[6]  Nathan F. Putman,et al.  Magnetic maps in animals: nature's GPS , 2007, Journal of Experimental Biology.

[7]  Esko Ukkonen,et al.  On-line construction of suffix trees , 1995, Algorithmica.

[8]  José A. Malpica,et al.  An automatic method for road extraction in rural and semi-urban areas starting from high resolution satellite imagery , 2005, Pattern Recognit. Lett..

[9]  M S Waterman,et al.  Identification of common molecular subsequences. , 1981, Journal of molecular biology.

[10]  Frédéric Chazal,et al.  A Sampling Theory for Compact Sets in Euclidean Space , 2009, Discret. Comput. Geom..

[11]  A. Baumgartner.  EFFICIENT METHODS AND INTERFACES FOR ROAD TRACKING , 2002 .

[12]  M. Crochemore,et al.  On-line construction of suffix trees , 2002 .

[13]  S. Muthukrishnan,et al.  Approximate nearest neighbors and sequence comparison with block operations , 2000, STOC '00.

[14]  Subhash Suri,et al.  A pedestrian approach to ray shooting: shoot a ray, take a walk , 1993, SODA '93.

[15]  Ryosuke Shibasaki,et al.  Semi-automatic road extraction from high-resolution satellite image , 2002 .

[16]  C. Steger,et al.  The Role of Grouping for Road Extraction , 1997 .

[17]  Pierre Alliez,et al.  Computational geometry algorithms library , 2008, SIGGRAPH '08.

[18]  Tao Guo,et al.  Towards high accuracy road maps generation from massive GPS Traces data , 2007, 2007 IEEE International Geoscience and Remote Sensing Symposium.

[19]  R. Bruntrup,et al.  Incremental map generation with GPS traces , 2005, Proceedings. 2005 IEEE Intelligent Transportation Systems, 2005..

[20]  Sariel Har-Peled.  Clustering Motion , 2004, Discret. Comput. Geom..

[21]  David Eppstein,et al.  Studying (non-planar) road networks through an algorithmic lens , 2008, GIS '08.

[22]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

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

[24]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[25]  Kurt Mehlhorn,et al.  Curve reconstruction: Connecting dots with good reason , 2000, Comput. Geom..

[26]  Hervé Le Men,et al.  Map understanding for GIS data capture: Algorithms for road network graph reconstruction , 1993, Proceedings of 2nd International Conference on Document Analysis and Recognition (ICDAR '93).

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

[28]  Bin Ma,et al.  On spaced seeds for similarity search , 2004, Discret. Appl. Math..