Scalable shortest paths browsing on land surface

The growing popularity of online Earth visualization tools and geo-realistic games and the availability of high resolution terrain data have motivated a new class of queries to the interests of the GIS and spatial database community: spatial queries (e.g., kNN) over land surface. However, the fundamental challenges that restrict the applicability of these studies to real world applications are the prohibitive time complexity and storage overhead to precompute the shortest surface paths. In this paper, for the first time, we propose an approximate solution to address both challenges and allow browsing the shortest surface paths in O(log N + √N) time, where N is the size of the terrain. With this method, the time and space requirements for an exhaustive all-pair pre-computation have been reduced from O(N3) to O(N1.5) and O(N) respectively. The substantial savings in both time and storage are gained by taking advantage of the fact that the O(N2) surface paths only deviate from approximate straight lines at O(√N) points, termed rough vertices. As a result, we propose a linear time shortest surface path computation algorithm between two arbitrary vertices and a linear size storage structure, which captures all the shortest surface paths between any pair of vertices. We experimentally verified the applicability and scalability of the proposed methods with large real world and synthetic data sets and showed that accuracy higher than 97% can be obtained in most cases.

[1]  Hanan Samet,et al.  Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling) , 2005 .

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Joseph O'Rourke,et al.  An Implementation of Chen & Han's Shortest Paths Algorithm , 2000, Canadian Conference on Computational Geometry.

[4]  Hanan Samet,et al.  Path Oracles for Spatial Networks , 2009, Proc. VLDB Endow..

[5]  Scott D. Roth,et al.  Ray casting for modeling solids , 1982, Comput. Graph. Image Process..

[6]  Cyrus Shahabi,et al.  Continuous Monitoring of Nearest Neighbors on Land Surface , 2009, Proc. VLDB Endow..

[7]  Hugues Hoppe.  Smooth view-dependent level-of-detail control and its application to terrain rendering , 1998 .

[8]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[9]  Jack Snoeyink,et al.  Reducing the memory required to find a geodesic shortest path on a large mesh , 2009, GIS.

[10]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[11]  Yijie Han,et al.  Shortest paths on a polyhedron , 1990, SCG '90.

[12]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2003, GeoInformatica.

[13]  Cyrus Shahabi,et al.  A Road Network Embedding Technique for K-Nearest Neighbor Search in Moving Object Databases , 2002, GIS '02.

[14]  Cyrus Shahabi,et al.  Indexing land surface for efficient kNN query , 2008, Proc. VLDB Endow..

[15]  Hanan Samet,et al.  Scalable network distance browsing in spatial databases , 2008, SIGMOD Conference.

[16]  Hiromasa Suzuki,et al.  Approximate shortest path on a polyhedral surface based on selective refinement of the discrete graph and its applications , 2000, Proceedings Geometric Modeling and Processing 2000. Theory and Applications.

[17]  Hanan Samet,et al.  Foundations of multidimensional and metric data structures , 2006, Morgan Kaufmann series in data management systems.

[18]  Kenji Shimada,et al.  Geometric Modeling and Processing 2006 , 2007, Comput. Aided Geom. Des..

[19]  Jörg-Rüdiger Sack,et al.  Approximating Shortest Paths on Weighted Polyhedral Surfaces , 2001, Algorithmica.

[20]  Joseph S. B. Mitchell,et al.  The Discrete Geodesic Problem , 1987, SIAM J. Comput..

[21]  Qing Liu,et al.  A multi-resolution surface distance model for k-NN query processing , 2008, The VLDB Journal.

[22]  Regis Hoffman,et al.  Terrain Roughness Measurement from Elevation Maps , 1990, Other Conferences.