Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

DAGM
2005
Springer

favoriteEmaildiscussreport

145views Image Processing» more DAGM 2005»

A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds

13 years 10 months ago

A Method for Fast Search of Variable Regions on Dynamic 3D Point Clouds

Download www.dlr.de

The paper addresses the region search problem in three-dimensional (3D) space. The data used is a dynamically growing point cloud as it is typically gathered with a 3D-sensing device like a laser range-scanner. An encoding of space in combination with a new region search algorithm is introduced. The algorithm allows for fast access to spherical subsets of variable size. An octree based and a balanced binary tree based implementation are discussed. Finally, experiments concerning processing time are shown.

Eric Wahl, Gerd Hirzinger

Real-time Traffic

DAGM 2005 | Region Search | Region Search Algorithm | Region Search Problem |

claim paper

Related Content

» Model Globally Match Locally Efficient and Robust 3D Object Recognition

» AnatomicallyAware Automatic and Fast Registration of 3D Ear Impression Models

» On fast surface reconstruction methods for large and noisy point clouds

» Cached kd tree search for ICP algorithms

» Efficient Sparse 3D Reconstruction by Space Sweeping

» FLIRT Interest regions for 2D range data

» The skip quadtree a simple dynamic data structure for multidimensional data

» Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering

» Using Lower Bounds During Dynamic BDD Minimization

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	DAGM
Authors	Eric Wahl, Gerd Hirzinger

Comments (0)