Proximity Queries on Point Clouds using Rapid Construction Path Oracle
Summary: Proposes a (1+ε)-approximate shortest-path oracle for point clouds that stores pairwise POI paths, enabling fast shortest-path, kNN, and range queries. Outperforms the best-known TIN oracle: up to 390×/30×/6× (POIs given) and 500×/140×/50× (POIs not given); kNN and range queries up to 100× faster. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yinzhao Yan (Hong Kong University of Science and Technology)
- 2. Raymond Chi-Wing Wong (Hong Kong University of Science and Technology)
BibTeX Citation
@inproceedings{yan_sigmod24,
title = {{Proximity Queries on Point Clouds using Rapid Construction Path Oracle}},
author = {Yan, Yinzhao and Wong, Raymond Chi-Wing},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639261},
url = {https://dl.acm.org/doi/10.1145/3639261},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,314 | Efficient Proximity Queries on Simplified Height Maps | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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,526 | Path Advisor: A Multi-Functional Campus Map Tool for Shortest Path | 2021 | VLDB | 5.4119882e-05 |
| 8,532 | New Lower and Upper Bounds for Shortest Distance Queries on Terrains | 2016 | VLDB | 5.4119882e-05 |
| 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 |
| 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
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,605 | Efficient Search for the Top-k Probable Nearest Neighbors in Uncertain Databases | 2008 | VLDB |
| 2 | 8,848 | A Generalized Approach for Reducing Expensive Distance Calls for A Broad Class of Proximity Problems | 2021 | SIGMOD |
| 3 | 8,532 | New Lower and Upper Bounds for Shortest Distance Queries on Terrains | 2016 | VLDB |
| 4 | 665 | Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases | 2004 | VLDB |
| 5 | 8,537 | Finding Shortest Paths on Terrains by Killing Two Birds with One Stone | 2014 | VLDB |
| 6 | 968 | Path Oracles for Spatial Networks | 2009 | VLDB |
| 7 | 4,786 | Architecture-Intact Oracle for Fastest Path and Time Queries on Dynamic Spatial Networks | 2020 | SIGMOD |
| 8 | 11,380 | EAR-Oracle: On Efficient Indexing for Distance Queries between Arbitrary Points on Terrain Surface | 2023 | SIGMOD |
| 9 | 10,314 | Efficient Proximity Queries on Simplified Height Maps | 2026 | SIGMOD |
| 10 | 11,993 | Distance Oracle on Terrain Surface | 2017 | SIGMOD |