Fast exact shortest distance queries for massive point clouds |
| |
| Affiliation: | 1. Center for Applied Mathematics, Cornell University, Ithaca, New York, USA;2. Fraunhofer-Chalmers Centre, Gothenburg, Sweden;1. Henan Key Laboratory of Intelligent Manufacturing of Mechanical Equipment, Mechanical and Electrical Engineering Institute, Zhengzhou University of Light Industry, Zhengzhou, 450002, Henan, China;2. College of Mechanical Engineering, Hunan University of Technology, Zhuzhou, 412007, Hunan, China;1. Faculty of Science, Engineering and Computing, Penrhyn Road, Kingston upon Thames, Surrey KT1 2EE, UK;2. School of Computer Science, University of Nottingham, Nottingham, NG8 1BB, UK |
| |
| Abstract: | This paper describes a new efficient algorithm for the rapid computation of exact shortest distances between a point cloud and another object (e.g. triangulated, point-based, etc.) in three dimensions. It extends the work presented in Eriksson and Shellshear (2014) where only approximate distances were computed on a simplification of a massive point cloud. Here, the fast computation of the exact shortest distance is achieved by pruning large subsets of the point cloud known not to be closest to the other object. The approach works for massive point clouds even with a small amount of RAM and is able to provide real time performance. Given a standard PC with only 8GB of RAM, this resulted in real-time shortest distance computations of 15 frames per second for a point cloud having 1 billion points in three dimensions. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
