653 search results - page 65 / 131 » Efficient reconstruction from non-uniform point sets |
130
click to vote
ALENEX
2001
15 years 1 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
130
click to vote
3DPVT
2004
IEEE
15 years 3 months ago
2004
IEEE
Looking around in our every day environment, many of the encountered objects are specular to some degree. Actively using this fact when reconstructing objects from image sequences...
109
click to vote
ECCV
2008
Springer
16 years 1 months ago
2008
Springer
We propose a convex framework for silhouette and stereo fusion in 3D reconstruction from multiple images. The key idea is to show that the reconstruction problem can be cast as one...
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
ICAPR
2009
Springer
15 years 6 months ago
2009
Springer
Morphological operators designed for grey-scale functions process every points of the space identically whatever their luminance. In many situations however, it is interesting to ...