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
11307
Venue
VLDB
Year
2016
Pagerank
4.1945683e-05
Overall Rank
11,878 | 17.37%
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,513 Continuous Monitoring of Nearest Neighbors on Land Surface 2009 VLDB 0.00011593275
1,514 Indexing Land Surface for Efficient kNN Query 2008 VLDB 0.00011593275
12,017 Finding Shortest Paths on Terrains by Killing Two Birds with One Stone 2014 VLDB 4.1945683e-05
12,172 Finding Shortest Path on Land Surface 2011 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers