Sciweavers

195 search results - page 13 / 39
» Surface Approximation and Geometric Partitions
Sort
View
3DIM
2011
IEEE
13 years 9 months ago
Visual Hull from Imprecise Polyhedral Scene
—We present a framework to compute the visual hull of a polyhedral scene, in which the vertices of the polyhedra are given with some imprecision. Two kinds of visual event surfac...
Peng He, Abbas Edalat
CVPR
2004
IEEE
15 years 11 months ago
Reconstructing Open Surfaces from Unorganized Data Points
In this paper a method for fitting open surfaces to an unorganized set of data points is presented using a level set representation of the surface. This is done by tracking a curv...
Jan Erik Solem, Anders Heyden
SGP
2003
14 years 11 months ago
Edge-Sharpener: Recovering Sharp Features in Triangulations of non-adaptively re-meshed surfaces
3D scanners, iso-surface extraction procedures, and several recent geometric compression schemes sample surfaces of 3D shapes in a regular fashion, without any attempt to align th...
Marco Attene, Bianca Falcidieno, Michela Spagnuolo...
TSMC
2002
119views more  TSMC 2002»
14 years 9 months ago
Approximation of n-dimensional data using spherical and ellipsoidal primitives
This paper discusses the problem of approximating data points in -dimensional Euclidean space using spherical and ellipsoidal surfaces. A closed form solution is provided for spher...
Giuseppe Carlo Calafiore
CORR
2008
Springer
96views Education» more  CORR 2008»
14 years 9 months ago
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
Frédéric Mazoit