/Data Structure for Efficient Processing in 3-D

Data Structure for Efficient Processing in 3-D

Jean-Francois Lalonde, Nicolas Vandapel and Martial Hebert
Conference Paper, Robotics: Science and Systems 1, June, 2005

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.


Autonomous navigation in natural environment requires three-dimensional (3-D) scene representation and interpretation. High density laser-based sensing is commonly used to capture the geometry of the scene, producing large amount of 3-D points with variable spatial density. We proposed a terrain classification method using such data. The approach relies on the computation of local features in 3-D using a support volume and belongs, as such, to a larger class of computational problems where range searches are necessary. This operation on traditional data structure is very expensive and, in this paper, we present an approach to address this issue. The method relies on reusing already computed data as the terrain classification process progresses over the environment representation. We present results that show significant speed improvement using ladar data collected in various environments with a ground mobile robot.

BibTeX Reference
author = {Jean-Francois Lalonde and Nicolas Vandapel and Martial Hebert},
title = {Data Structure for Efficient Processing in 3-D},
booktitle = {Robotics: Science and Systems 1},
year = {2005},
month = {June},
publisher = {MIT Press},
keywords = {data structure, classification, 3-D},