Songhua Xing
Cyrus Shahabi
ABSTRACT
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.
- J. Chen and Y. Han: Shortest paths on a polyhedron. 6th ACM Symp. Comput. Geometry, 1990. Google Scholar
Digital Library
- M. Lanthier, A. Maheshwari, J. Sack. Approximating shortest paths on weighted polyhedral surfaces. Algorithmica, 2001.Google ScholarCross Ref
- T. Kanai and H. Suzuki. Approximate shortest path on polyhedral surface based on selective refinement of the discrete graph and its applications. Geometric Modeling and Processing, 2000. Google ScholarDigital Library
- K. Deng, X. Zhou, H. Shen, Q. Liu, K. Xu and X. Lin: A Multi-resolution surface distance model for k-NN query processing. The VLDB Journal, June 2008. Google ScholarDigital Library
- C. Shahabi, L. Tang and S. Xing: Indexing land surface for efficient kNN query. PVLDB 1(1) 2008. Google ScholarDigital Library
- S. Xing, C. Shahabi and B. Pan: continuous monitoring of nearest neighbors on land surface. PVLDB 2(1) 2009 Google ScholarDigital Library
- S. Roth: Ray casting for modeling solids. Computer Graphics and Image Processing 18(2) 1982.Google Scholar
- W. Pratt: Digital Image Processing (4th Edition). John Wiley & Sons, Inc. Pages 465--534. 2007. Google ScholarDigital Library
- H. Samet, J. Sankaranarayanan, H. Alborzi: Scalable network distance browsing in spatial databases. SIGMOD 2008. Google ScholarDigital Library
- J. Sankaranarayanan, H. Samet and H. Alborzi: Paths oracles for spatial networks. PVLDB 2(1) 2009 Google ScholarDigital Library
- H. Hoppe: Smooth view-dependent level-of-detail control and its application to terrain rendering. IEEE Visualization, 1998. Google ScholarDigital Library
- R. Hoffman, E. Krotkov. Terrain roughness measurement from elevation maps: SPIE Vol. 1195, 1989.Google Scholar
- http://data.geocomm.com.Google Scholar
- H. Samet: Foundations of multidimensional and metric data structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling). 2005. Google ScholarDigital Library
- V. Verma and J. Snoeyink: Reducing the memory required to find a geodesic shortest path on a large mesh. ACM SIGSPATIAL GIS 2009 Google ScholarDigital Library
- E. W. Dijkstra: A note on two problems in connection with graphs. Numeriche Mathematik, 1:269--271, 1959.Google ScholarDigital Library
- M. Berg, M. Kreveld, M. Overmars, and O. Schwarzkopf: Computational Geometry: Algorithms & Applications. 2000. Google ScholarDigital Library
- C. Shahabi, M. R. Kolahdouzan, M. Sharifzadeh: A road network embedding technique for k-nearest neighbor search in moving object databases. ACM GIS 2002. Google ScholarDigital Library
- J. S. B Mitchell, D. M. Mount, and C. H. Papadimitriou: The discrete geodesic problem. SIAM Journal of Computing, 16(4):647--668, 1987 Google ScholarDigital Library
- B. Kaneva and J. O'Rourke: An implementation of Chen & Han's shortest paths algorithm. Proc. of 12th Canadian Conf. on Comput. Geom, 2000.Google Scholar
- P. Hart, N. Nilsson, and B. Raphael: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics. 1968.Google ScholarCross Ref
Index Terms
- Scalable shortest paths browsing on land surface
Recommendations
Shortest path problem with uncertain arc lengths
Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, ...
On shortest paths and sorting
ACM '72: Proceedings of the ACM annual conference - Volume 1In finding shortest paths, the operation of finding, successively, a minimum from a list of numbers may require more work than the remainder of the algorithm. It is shown how algorithms from sorting literature can be used to accomplish this part of the ...
Finding shortest path on land surface
SIGMOD '11: Proceedings of the 2011 ACM SIGMOD International Conference on Management of dataFinding shortest paths is a fundamental operator in spatial databases. Recently, terrain datasets have attracted a lot of attention from both industry and academia. There are some interesting issues to be studied in terrain datasets which cannot be ...
Comments