1715 search results - page 142 / 343 » Point Sample Rendering |
GRC
2008
IEEE
13 years 11 months ago
2008
IEEE
Manifold learning can discover the structure of high dimensional data and provides understanding of multidimensional patterns by preserving the local geometric characteristics. Ho...
DCG
2008
13 years 10 months ago
2008
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
IJFCS
2002
13 years 9 months ago
2002
We propose a new data structure to compute the Delaunay triangulation of a set of points in the plane. It combines good worst case complexity, fast behavior on real data, small me...
ACCV
2010
Springer
13 years 5 months ago
2010
Springer
In this paper, we present an efficient algorithm for 3D object recognition in presence of clutter and occlusions in noisy, sparse and unsegmented range data. The method uses a robu...
IROS
2006
IEEE
14 years 4 months ago
2006
IEEE
Model-based recognition of an object typically involves matching dense 3D range data. The computational cost is directly affected by the amount of data of which a transformation n...