research-article

Proximity Queries on Point Clouds using Rapid Construction Path Oracle

Authors:

Raymond Chi-Wing WongAuthors Info & Claims

Proceedings of the ACM on Management of Data, Volume 2, Issue 1

Article No.: 6, Pages 1 - 26

https://doi.org/10.1145/3639261

Published: 26 March 2024 Publication History

Abstract

The prevalence of computer graphics technology boosts the developments of point clouds in recent years, which offer advantages over terrain surfaces (represented by Triangular Irregular Networks, i.e., TINs) in proximity queries, including the shortest path query, the k-Nearest Neighbor (kNN) query and the range query. Since (1) all existing on-the-fly and oracle-based shortest path query algorithms on a TIN are very expensive, (2) all existing on-the-fly shortest path query algorithms on a point cloud are still not efficient, and (3) there are no oracle-based shortest path query algorithms on a point cloud, we propose an efficient (1+ε)-approximate shortest path oracle that answers the shortest path query for a set of Points-Of-Interests (POIs) on the point cloud, which has a good performance (in terms of the oracle construction time, oracle size and shortest path query time) due to the concise information about the pairwise shortest paths between any pair of POIs stored in the oracle. Our oracle can be easily adapted to answering the shortest path query for any points on the point cloud if POIs are not given as input, and also achieve a good performance. Then, we propose efficient algorithms for answering the (1+ε)-approximate kNN and range query with the assistance of our oracle. Our experimental results show that when POIs are given (resp. not given) as input, our oracle is up to 390 times, 30 times and 6 times (resp. 500 times, 140 times and 50 times) better than the best-known oracle on a TIN in terms of the oracle construction time, oracle size and shortest path query time, respectively. Our algorithms for the other two proximity queries are both up to 100 times faster than the best-known algorithms.

Supplemental Material

MP4 File

Presentation slides and video

Download
178.76 MB

PPTX File

Presentation slides and video

Download
6.37 MB

ZIP File

Presentation slides and video

Download
163.07 MB

ZIP File

Presentation slides and video

Download
163.07 MB

ZIP File

Presentation slides and video

Download
163.07 MB

References

[1]

2022. Blender. https://www.blender.org

[2]

2022. Google Earth. https://earth.google.com/web

[3]

2022. Robinson Mountain. https://www.mountaineers.org/activities/routes-places/robinson-mountain

[4]

2023. Cyberpunk 2077. https://www.cyberpunk.net

[5]

2023. Data Geocomm. http://data.geocomm.com/

[6]

2023. Google Map. https://www.google.com/maps

[7]

2023. Gunnison National Forest. https://gunnisoncrestedbutte.com/visit/places-to-go/parks-and-outdoors/gunnison-national-forest/

[8]

2023. Laramie Mountain. https://www.britannica.com/place/Laramie-Mountains

[9]

2023. Preferred walking speed. https://en.wikipedia.org/wiki/Preferred_walking_speed

[10]

Mithil Aggarwal. 2022. More than 60 killed in blizzard wreaking havoc across U.S. https://www.cnbc.com/2022/12/26/death-toll-rises-to-at-least-55-as-freezing-temperatures-and-heavy-snow-wallop-swaths-of-us.html

[11]

Gergana Antova. 2019. Application of areal change detection methods using point clouds data. In IOP Conference Series: Earth and Environmental Science, Vol. 221. IOP Publishing, 012082.

[12]

Claudine Badue, Rânik Guidolini, Raphael Vivacqua Carneiro, Pedro Azevedo, Vinicius B Cardoso, Avelino Forechi, Luan Jesus, Rodrigo Berriel, Thiago M Paixao, Filipe Mutz, et al. 2021. Self-driving cars: A survey. Expert Systems with Applications 165 (2021), 113816.

[13]

Paul B Callahan and S Rao Kosaraju. 1995. A decomposition of multidimensional point sets with applications to k-nearest-neighbors and n-body potential fields. Journal of the ACM (JACM) 42, 1 (1995), 67--90.

Digital Library

[14]

Joseph Carsten, Arturo Rankin, Dave Ferguson, and Anthony Stentz. 2007. Global path planning on board the mars exploration rovers. In 2007 IEEE Aerospace Conference. IEEE, 1--11.

[15]

Jindong Chen and Yijie Han. 1990. Shortest Paths on a Polyhedron. In SOCG. New York, NY, USA, 360--369.

Digital Library

[16]

The Conversation. 2022. How is snowfall measured? A meteorologist explains how volunteers tally up winter storms. https://theconversation.com/how-is-snowfall-measured-a-meteorologist-explains-how-volunteers-tally-up-winter-storms-175628

[17]

Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press.

[18]

Yaodong Cui, Ren Chen, Wenbo Chu, Long Chen, Daxin Tian, Ying Li, and Dongpu Cao. 2021. Deep learning for image and point cloud fusion in autonomous driving: A review. IEEE Transactions on Intelligent Transportation Systems 23, 2 (2021), 722--739.

Digital Library

[19]

Ke Deng, Heng Tao Shen, Kai Xu, and Xuemin Lin. 2006. Surface k-NN query processing. In 22nd International Conference on Data Engineering (ICDE'06). IEEE, 78--78.

Digital Library

[20]

Ke Deng and Xiaofang Zhou. 2004. Expansion-based algorithms for finding single pair shortest path on surface. In International Workshop on Web and Wireless Geographical Information Systems. Springer, 151--166.

[21]

Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, and Xuemin Lin. 2008. A multi-resolution surface distance model for k-nn query processing. The VLDB Journal 17, 5 (2008), 1101--1119.

Digital Library

[22]

Brett G Dickson and P Beier. 2007. Quantifying the influence of topographic position on cougar (Puma concolor) movement in southern California, USA. Journal of Zoology 271, 3 (2007), 270--277.

[23]

Edsger W Dijkstra. 1959. A note on two problems in connexion with graphs. Numerische mathematik 1, 1 (1959), 269--271.

[24]

David Eriksson and Evan Shellshear. 2014. Approximate distance queries for path-planning in massive point clouds. In 2014 11th International Conference on Informatics in Control, Automation and Robotics (ICINCO), Vol. 2. IEEE, 20--28.

Digital Library

[25]

David Eriksson and Evan Shellshear. 2016. Fast exact shortest distance queries for massive point clouds. Graphical Models 84 (2016), 28--37.

Digital Library

[26]

Fresh Off The Grid. 2022. Winter Hiking 101: Everything you need to know about hiking in snow. https://www.freshoffthegrid.com/winter-hiking-101-hiking-in-snow/

[27]

Anupam Gupta, Robert Krauthgamer, and James R Lee. 2003. Bounded geometries, fractals, and low-distortion embeddings. In 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings. IEEE, 534--543.

[28]

Bo Huang, Victor Junqiu Wei, Raymond Chi-Wing Wong, and Bo Tang. 2023. EAR-Oracle: on efficient indexing for distance queries between arbitrary points on terrain surface. Proceedings of the ACM on Management of Data (SIGMOD) 1, 1 (2023), 1--26.

Digital Library

[29]

GreenValley International. 2023. 3D Point Cloud Data and the Production of Digital Terrain Models. https://geo-matching.com/content/3d-point-cloud-data-and-the-production-of-digital-terrain-models

[30]

Manohar Kaul, Raymond Chi-Wing Wong, and Christian S Jensen. 2015. New lower and upper bounds for shortest distance queries on terrains. Proceedings of the VLDB Endowment 9, 3 (2015), 168--179.

Digital Library

[31]

Manohar Kaul, Raymond Chi-Wing Wong, Bin Yang, and Christian S Jensen. 2013. Finding shortest paths on terrains by killing two birds with one stone. Proceedings of the VLDB Endowment 7, 1 (2013), 73--84.

Digital Library

[32]

Marcel Körtgen, Gil-Joo Park, Marcin Novotni, and Reinhard Klein. 2003. 3D shape matching with 3D shape contexts. In The 7th central European seminar on computer graphics, Vol. 3. Citeseer, 5--17.

[33]

Baki Koyuncu and Erkan Bostanci. 2009. 3D battlefield modeling and simulation of war games. Communications and Information Technology proceedings (2009).

[34]

Russell LaDuca. 2020. What would happen to me if I was buried under snow? https://qr.ae/prt6zQ

[35]

Mark Lanthier, Anil Maheshwari, and J-R Sack. 2001. Approximating shortest paths on weighted polyhedral surfaces. Algorithmica 30, 4 (2001), 527--562.

Digital Library

[36]

Lik-Hang Lee, Tristan Braud, Pengyuan Zhou, Lin Wang, Dianlei Xu, Zijun Lin, Abhishek Kumar, Carlos Bermejo, and Pan Hui. 2021. All one needs to know about metaverse: A complete survey on technological singularity, virtual ecosystem, and research agenda. arXiv preprint arXiv:2110.05352 (2021).

[37]

Lik-Hang Lee, Zijun Lin, Rui Hu, Zhengya Gong, Abhishek Kumar, Tangyao Li, Sijia Li, and Pan Hui. 2021. When creators meet the metaverse: A survey on computational arts. arXiv preprint arXiv:2111.13486 (2021).

[38]

Ying Li, Lingfei Ma, Zilong Zhong, Fei Liu, Michael A Chapman, Dongpu Cao, and Jonathan Li. 2020. Deep learning for lidar point clouds in autonomous driving: A review. IEEE Transactions on Neural Networks and Learning Systems 32, 8 (2020), 3412--3432.

[39]

Lian Liu and Raymond Chi-Wing Wong. 2011. Finding shortest path on land surface. In Proceedings of the 2011 ACM SIGMOD International Conference on Management of Data. 433--444.

Digital Library

[40]

Anders Mårell, John P Ball, and Annika Hofgaard. 2002. Foraging and movement paths of female reindeer: insights from fractal analysis, correlated random walks, and Lévy flights. Canadian Journal of Zoology 80, 5 (2002), 854--865.

[41]

Joseph SB Mitchell, David M Mount, and Christos H Papadimitriou. 1987. The discrete geodesic problem. SIAM J. Comput. 16, 4 (1987), 647--668.

Digital Library

[42]

Geo Week News. 2022. Tesla using radar to generate point clouds for autonomous driving. https://www.geoweeknews.com/news/tesla-using-radar-generate-point-clouds-autonomous-driving

[43]

Hoong Kee Ng, Hon Wai Leong, and Ngai Lam Ho. 2004. Efficient algorithm for path-based range query in spatial databases. In Proceedings. International Database Engineering and Applications Symposium, 2004. IDEAS'04. IEEE, 334--343.

[44]

Janet E Nichol, Ahmed Shaker, and Man-Sing Wong. 2006. Application of high-resolution stereo satellite images to detailed landslide hazard assessment. Geomorphology 76, 1--2 (2006), 68--75.

[45]

Sebastian Pütz, Thomas Wiemann, Jochen Sprickerhof, and Joachim Hertzberg. 2016. 3d navigation mesh generation for path planning in uneven terrain. IFAC-PapersOnLine 49, 15 (2016), 212--217.

[46]

Fabio Remondino. 2003. From point cloud to surface: the modeling and visualization problem. International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences 34 (2003).

[47]

National Park Service. 2022. Mount Rainier. https://www.nps.gov/mora/index.htm

[48]

National Park Service. 2022. Mount Rainier Annual Snowfall Totals. https://www.nps.gov/mora/planyourvisit/annual-snowfall-totals.htm

[49]

National Park Service. 2022. Mount Rainier Frequently Asked Questionss. https://www.nps.gov/mora/faqs.htm

[50]

National Weather Service. 2023. Measuring Snow. https://www.weather.gov/dvn/snowmeasure

[51]

Cyrus Shahabi, Lu-An Tang, and Songhua Xing. 2008. Indexing land surface for efficient knn query. Proceedings of the VLDB Endowment 1, 1 (2008), 1020--1031.

Digital Library

[52]

Jamie Shotton, John Winn, Carsten Rother, and Antonio Criminisi. 2006. Textonboost: Joint appearance, shape and context modeling for multi-class object recognition and segmentation. In European conference on computer vision. Springer, 1--15.

Digital Library

[53]

Barak Sober, Robert Ravier, and Ingrid Daubechies. 2020. Approximating the riemannian metric from point clouds via manifold moving least squares. arXiv preprint arXiv:2007.09885 (2020).

[54]

Spatial. 2022. LiDAR Scanning with Spatial's iOS App. https://support.spatial.io/hc/en-us/articles/360057387631-LiDAR-Scanning-with-Spatial-s-iOS-App

[55]

Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, and David M. Mount. 2017. Distance oracle on terrain surface. In Proceedings of the 2017 ACM SIGMOD International Conference on Management of Data. 1211--1226.

[56]

Victor Junqiu Wei, Raymond Chi-Wing Wong, Cheng Long, David M Mount, and Hanan Samet. 2022. Proximity queries on terrain surface. ACM Transactions on Database Systems (TODS) (2022).

[57]

Shi-Qing Xin and Guo-Jin Wang. 2009. Improving Chen and Han's algorithm on the discrete geodesic problem. ACM Transactions on Graphics 28, 4 (2009), 1--8.

Digital Library

[58]

Songhua Xing, Cyrus Shahabi, and Bei Pan. 2009. Continuous monitoring of nearest neighbors on land surface. Proceedings of the VLDB Endowment 2, 1 (2009), 1114--1125.

Digital Library

[59]

Da Yan, Zhou Zhao, and Wilfred Ng. 2012. Monochromatic and bichromatic reverse nearest neighbor queries on land surfaces. In Proceedings of the 21st ACM international conference on Information and knowledge management. 942--951.

Digital Library

[60]

Yinzhao Yan and Raymond Chi-Wing Wong. 2021. Path Advisor: a multi-functional campus map tool for shortest path. Proceedings of the VLDB Endowment 14, 12 (2021), 2683--2686.

Digital Library

[61]

Yinzhao Yan and Raymond Chi-Wing Wong. 2023. Proximity queries on point cloud using rapid construction path oracle (technical report). https://github.com/yanyinzhao/PointCloudPathCode/blob/master/TechnicalReport.pdf

[62]

Hongchuan Yu, Jian J Zhang, and Zheng Jiao. 2014. Geodesics on point clouds. Mathematical Problems in Engineering 2014 (2014).

Cited By

Yan YWong RJensen C(2025)An Efficiently Updatable Path Oracle for Terrain SurfacesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.348443437:2(557-571)Online publication date: Feb-2025
https://doi.org/10.1109/TKDE.2024.3484434
Yan YWong R(2024)Efficient Shortest Path Queries on 3D Weighted Terrain Surfaces for Moving Objects2024 25th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM61037.2024.00023(11-20)Online publication date: 24-Jun-2024
https://doi.org/10.1109/MDM61037.2024.00023

Index Terms

Proximity Queries on Point Clouds using Rapid Construction Path Oracle
1. Information systems
  1. Data management systems
    1. Data structures
      1. Data access methods
        Proximity search

Recommendations

Proximity Queries on Terrain Surface
Due to the advance of the geo-spatial positioning and the computer graphics technology, digital terrain data has become increasingly popular nowadays. Query processing on terrain data has attracted considerable attention from both the academic and the ...
Efficient Processing of Proximity Queries for Large Databases
ICDE '95: Proceedings of the Eleventh International Conference on Data Engineering

Emerging multimedia applications require database systems to provide support for new types of objects and to process queries that may have no parallel in traditional database applications. One such important class of queries are the proximity queries ...
Distance Oracle on Terrain Surface
SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data

Due to the advance of the geo-spatial positioning and the computer graphics technology, digital terrain data become more and more popular nowadays. Query processing on terrain data has attracted considerable attention from both the academic community ...

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Management of Data

Proceedings of the ACM on Management of Data Volume 2, Issue 1

SIGMOD

February 2024

1874 pages

EISSN:2836-6573

DOI:10.1145/3654807

Editor:
Divyakant Agrawal
UC Santa Barbara, United States

Issue’s Table of Contents

Copyright © 2024 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2024

Published in PACMMOD Volume 2, Issue 1

Permissions

Request permissions for this article.

Request Permissions

Author Tags

Qualifiers

Research-article

Funding Sources

Guangzhou Fund

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
127
Total Downloads

Downloads (Last 12 months)127
Downloads (Last 6 weeks)8

Reflects downloads up to 06 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yan YWong RJensen C(2025)An Efficiently Updatable Path Oracle for Terrain SurfacesIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2024.348443437:2(557-571)Online publication date: Feb-2025
https://doi.org/10.1109/TKDE.2024.3484434
Yan YWong R(2024)Efficient Shortest Path Queries on 3D Weighted Terrain Surfaces for Moving Objects2024 25th IEEE International Conference on Mobile Data Management (MDM)10.1109/MDM61037.2024.00023(11-20)Online publication date: 24-Jun-2024
https://doi.org/10.1109/MDM61037.2024.00023

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Issue’s Table of Contents