New Lower and Upper Bounds for Shortest Distance Queries on Terrains
Summary: Introduces new lower/upper bounds for terrain shortest-distance queries that are provably tighter than prior bounds. Unlike triangulation-dependent bounds, they do not rely on mesh quality, enabling pruning and nearly an order-of-magnitude speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Manohar Kaul (Technical University of Berlin)
- 2. Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
- 3. Christian S. Jensen (Aalborg University)
BibTeX Citation
@article{kaul_vldb16,
title = {{New Lower and Upper Bounds for Shortest Distance Queries on Terrains}},
author = {Kaul, Manohar and Wong, Raymond Chi-Wing and Jensen, Christian S.},
journal = {PVLDB},
series = {{VLDB} '16},
volume = {9},
number = {3},
pages = {168--179},
doi = {10.14778/2850583.2850591},
url = {https://doi.org/10.14778/2850583.2850591},
year = {2016}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,213 | Constrained Shortest Path Finding on Terrain Surfaces | 2026 | SIGMOD | 5.093636e-05 |
| 10,314 | Efficient Proximity Queries on Simplified Height Maps | 2026 | SIGMOD | 5.093636e-05 |
| 11,156 | Proximity Queries on Point Clouds using Rapid Construction Path Oracle | 2024 | SIGMOD | 5.093636e-05 |
| 11,380 | EAR-Oracle: On Efficient Indexing for Distance Queries between Arbitrary Points on Terrain Surface | 2023 | SIGMOD | 5.093636e-05 |
| 11,993 | Distance Oracle on Terrain Surface | 2017 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,618 | Continuous Monitoring of Nearest Neighbors on Land Surface | 2009 | VLDB | 0.00010207737 |
| 1,619 | Indexing Land Surface for Efficient kNN Query | 2008 | VLDB | 0.00010207737 |
| 8,537 | Finding Shortest Paths on Terrains by Killing Two Birds with One Stone | 2014 | VLDB | 5.4119882e-05 |
| 8,543 | Finding Shortest Path on Land Surface | 2011 | SIGMOD | 5.4119882e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 12,690 | Efficient Query Processing on Unstructured Tetrahedral Meshes | 2006 | SIGMOD |
| 2 | 11,156 | Proximity Queries on Point Clouds using Rapid Construction Path Oracle | 2024 | SIGMOD |
| 3 | 8,543 | Finding Shortest Path on Land Surface | 2011 | SIGMOD |
| 4 | 10,314 | Efficient Proximity Queries on Simplified Height Maps | 2026 | SIGMOD |
| 5 | 8,614 | The Case for Distance-Bounded Spatial Approximations | 2021 | CIDR |
| 6 | 1,619 | Indexing Land Surface for Efficient kNN Query | 2008 | VLDB |
| 7 | 433 | Scalable Network Distance Browsing in Spatial Databases | 2008 | SIGMOD |
| 8 | 1,441 | Efficient Processing of Top-k Spatial Preference Queries | 2011 | VLDB |
| 9 | 11,993 | Distance Oracle on Terrain Surface | 2017 | SIGMOD |
| 10 | 8,537 | Finding Shortest Paths on Terrains by Killing Two Birds with One Stone | 2014 | VLDB |