By Topic

An efficient online algorithm for direct octree construction from range images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yong Yu ; Sch. of Eng. Sci., Simon Fraser Univ., Burnaby, BC, Canada ; Gupta, K.

We present an algorithm for direct octree construction from range images. It uses a key property of most range sensors that all the voxels on sensed object surfaces are “visible” from the sensor. This enables us to define a projection map for range images. The projection map is used for efficiently checking if a given voxel is in the free region. Furthermore, this key property also reduces the number of faces to be checked for the nodes when constructing octrees. The algorithm is efficient in both memory space and run time, and is useful for sensor-based articulated robot motion planning, which is the main motivation for this work

Published in:

Robotics and Automation, 1998. Proceedings. 1998 IEEE International Conference on  (Volume:4 )

Date of Conference:

16-20 May 1998