Shortest paths on a polyhedron
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Surface simplification using quadric error metrics
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Optimal multi-step k-nearest neighbor search
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Efficient computation of geodesic shortest paths
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
A road network embedding technique for k-nearest neighbor search in moving object databases
Proceedings of the 10th ACM international symposium on Advances in geographic information systems
CCAM: A Connectivity-Clustered Access Method for Networks and Network Computations
IEEE Transactions on Knowledge and Data Engineering
I/O-Efficiency of Shortest Path Algorithms: An Analysis
Proceedings of the Eighth International Conference on Data Engineering
Path Computation Algorithms for Advanced Traveller Information System (ATIS)
Proceedings of the Ninth International Conference on Data Engineering
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Approximating Shortest Paths on a Nonconvex Polyhedron
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
GMP '00 Proceedings of the Geometric Modeling and Processing 2000
Direct Mesh: a Multiresolution Approach to Terrain Visualization
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Aggregate Nearest Neighbor Queries in Road Networks
IEEE Transactions on Knowledge and Data Engineering
iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
ACM Transactions on Database Systems (TODS)
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Query processing in spatial network databases
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Voronoi-based K nearest neighbor search for spatial network databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Expansion-Based algorithms for finding single pair shortest path on surface
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Indexing land surface for efficient kNN query
Proceedings of the VLDB Endowment
Continuous monitoring of nearest neighbors on land surface
Proceedings of the VLDB Endowment
Scalable shortest paths browsing on land surface
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Finding shortest path on land surface
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Fast GPU-based locality sensitive hashing for k-nearest neighbor computation
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Indexing methods for efficient protein 3D surface search
Proceedings of the ACM sixth international workshop on Data and text mining in biomedical informatics
Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces
Proceedings of the 21st ACM international conference on Information and knowledge management
Hi-index | 0.00 |
A spatial k-NN query returns k nearest points in a point dataset to a given query point. To measure the distance between two points, most of the literature focuses on the Euclidean distance or the network distance. For many applications, such as wildlife movement, it is necessary to consider the surface distance, which is computed from the shortest path along a terrain surface. In this paper, we investigate the problem of efficient surface k-NN (sk-NN) query processing. This is an important yet highly challenging problem because the underlying environment data can be very large and the computational cost of finding the shortest path on a surface can be very high. To minimize the amount of surface data to be used and the cost of surface distance computation, a multi-resolution surface distance model is proposed in this paper to take advantage of monotonic distance changes when the distances are computed at different resolution levels. Based on this innovative model, sk-NN queries can be processed efficiently by accessing and processing surface data at a just-enough resolution level within a just-enough search region. Our extensive performance evaluations using real world datasets confirm the efficiency of our proposed model.