DBScholar

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
11137
Venue
VLDB
Year
2014
Pagerank
5.4119882e-05
Overall Rank
8,537 | 41.43%
DOI
10.14778/2732232.2732239

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{kaul_vldb14,
        title = {{Finding Shortest Paths on Terrains by Killing Two Birds with One Stone}},
        author = {Kaul, Manohar and Wong, Raymond Chi-Wing and Yang, Bin and Jensen, Christian S.},
        journal = {PVLDB},
        series = {{VLDB} '14},
        volume = {7},
        number = {1},
        pages = {73--84},
        doi = {10.14778/2732232.2732239},
        url = {https://doi.org/10.14778/2732232.2732239},
        year = {2014}
}

Incoming Citations (Sorted by Pagerank)

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

Semantically Similar Papers