602 search results - page 71 / 121 » Segmenting point-sampled surfaces |
111
click to vote
VISUALIZATION
2002
IEEE
15 years 4 months ago
2002
IEEE
Typically 3-D MR and CT scans have a relatively high resolution in the scanning X;Y plane, but much lower resolution in the axial Z direction. This non-uniform sampling of an obje...
COMPGEOM
2010
ACM
15 years 3 months ago
2010
ACM
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
CVPR
2010
IEEE
15 years 2 days ago
2010
IEEE
This paper addresses the problem of segmenting a combination of linear subspaces and quadratic surfaces from sample data points corrupted by (not necessarily small) noise. Our mai...
111
click to vote
3DPVT
2006
IEEE
15 years 3 months ago
2006
IEEE
Detection and analysis of ocean surface phenomena have so far relied on manual analysis of long sequences of satellite images or images produced from the mathematical models. In t...
DCG
2010
14 years 12 months ago
2010
We extend the notion of star unfolding to be based on a quasigeodesic loop Q rather than on a point. This gives a new general method to unfold the surface of any convex polyhedron ...