Sciweavers

12 search results - page 2 / 3
» A Method for Fast Search of Variable Regions on Dynamic 3D P...
Sort
View
3DPVT
2006
IEEE
295views Visualization» more  3DPVT 2006»
13 years 8 months ago
Efficient Sparse 3D Reconstruction by Space Sweeping
This paper introduces a feature based method for the fast generation of sparse 3D point clouds from multiple images with known pose. We extract sub-pixel edge elements (2D positio...
Joachim Bauer, Christopher Zach, Horst Bischof
ICRA
2010
IEEE
267views Robotics» more  ICRA 2010»
13 years 4 months ago
FLIRT - Interest regions for 2D range data
— Local image features are used for a wide range of applications in computer vision and range imaging. While there is a great variety of detector-descriptor combinations for imag...
Gian Diego Tipaldi, Kai Oliver Arras
COMPGEOM
2005
ACM
13 years 8 months ago
The skip quadtree: a simple dynamic data structure for multidimensional data
We present a new multi-dimensional data structure, which we call the skip quadtree (for point data in R2) or the skip octree (for point data in Rd, with constant d > 2). Our da...
David Eppstein, Michael T. Goodrich, Jonathan Z. S...
VISUALIZATION
1993
IEEE
13 years 10 months ago
Rapid Exploration of Curvilinear Grids Using Direct Volume Rendering
Fast techniques for direct volume rendering over curvilinear grids of hexahedral cells are developed. This type of 3D grid is common in computational uid dynamics and nite element...
Allen Van Gelder, Jane Wilhelms
DAC
1999
ACM
13 years 10 months ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther