/Data Structures for Efficient Dynamic Processing in 3-D

Data Structures for Efficient Dynamic Processing in 3-D

Jean-Francois Lalonde, Nicolas Vandapel and Martial Hebert
Journal Article, Carnegie Mellon University, The International Journal of Robotics Research, Vol. 26, No. 8, pp. 777-796, August, 2007

Download Publication (PDF)

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author’s copyright. These works may not be reposted without the explicit permission of the copyright holder.


This paper considers the problem of the dynamic processing of large amounts of sparse three-dimensional data. It is assumed that computations are performed in a neighborhood defined around each point in order to retrieve local properties. This general kind of processing can be applied to a wide variety of problems. A new, efficient data structure and corresponding algorithms are proposed that significantly improve the speed of the range search operation and that are suitable for on-line operation where data is accumulated dynamically. The method relies on taking advantage of overlapping neighborhoods and the reuse of previously computed data as the algorithm scans each data point. To demonstrate the dynamic capabilities of the data structure, data obtained from a laser radar mounted on a ground mobile robot operating in complex, outdoor environments is used. It is shown that this approach considerably improves the speed of an established 3-D perception processing algorithm.

BibTeX Reference
author = {Jean-Francois Lalonde and Nicolas Vandapel and Martial Hebert},
title = {Data Structures for Efficient Dynamic Processing in 3-D},
journal = {The International Journal of Robotics Research},
year = {2007},
month = {August},
volume = {26},
number = {8},
pages = {777-796},