Name
Abstract | ||
|---|---|---|
With the increasing availability of terrain data, e.g., from aerial laser scans, the management of such data is attracting increasing attention in both industry and academia. In particular, spatial queries, e.g., k-nearest neighbor and reverse nearest neighbor queries, in Euclidean and spatial network spaces are being extended to terrains. Such queries all rely on an important operation, that of finding shortest surface distances. However, shortest surface distance computation is very time consuming. We propose techniques that enable efficient computation of lower and upper bounds of the shortest surface distance, which enable faster query processing by eliminating expensive distance computations. Empirical studies show that our bounds are much tighter than the best-known bounds in many cases and that they enable speedups of up to 43 times for some well-known spatial queries. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.14778/2732219.2732226 | VLDB |
Field | DocType | Volume |
k-nearest neighbors algorithm,Spatial network,Computer science,Terrain,Theoretical computer science,Euclidean geometry,Computation | Journal | 7 |
Issue | ISSN | Citations |
1 | 2150-8097 | 8 |
PageRank | References | Authors |
0.48 | 11 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Manohar Kaul | 1 | 185 | 13.76 |
| Raymond Chi-Wing Wong | 2 | 1305 | 85.98 |
| Bin Yang | 3 | 706 | 34.93 |
| Christian S. Jensen | 4 | 10651 | 1129.45 |