Database Paper Browser

Back to papers

Finding Shortest Paths on Terrains by Killing Two Birds with One Stone

Summary: Proposes lower/upper bounds for shortest surface distance on terrains to accelerate terrain-spatial queries. Bounds tighter than prior work prune expensive distances, yielding up to 43x speedups for kNN and reverse kNN in terrain spaces. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10949
Venue
VLDB
Year
2014
Pagerank
4.1945683e-05
Overall Rank
12,017 | 16.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 6 of 6 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 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,172 Finding Shortest Path on Land Surface 2011 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Semantically Similar Papers