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.

• Type: Conference
• Year: 2010
• Where: SODA
• Authors: Daniel Chen, Leonidas J. Guibas, John Hershberger, Jian Sun
• Keywords: Appropriate Data Structures, Discrete Algorithms, Path Similarity Queries, Polygonal Paths, SODA 2010