Database Paper Browser

Back to papers

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)

Paper ID
11308
Venue
VLDB
Year
2016
Pagerank
5.1725247e-05
Overall Rank
11,886 | 17.40%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

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,740 Continuous Monitoring of Nearest Neighbors on Land Surface 2009 VLDB 9.9386368e-05
1,741 Indexing Land Surface for Efficient kNN Query 2008 VLDB 9.9386368e-05
12,025 Finding Shortest Paths on Terrains by Killing Two Birds with One Stone 2014 VLDB 5.1725247e-05
12,180 Finding Shortest Path on Land Surface 2011 SIGMOD 5.1725247e-05
Previous Page 1 / 1 Next

Semantically Similar Papers