339 search results - page 60 / 68 » Geometry of Graphs |
ICCV
2005
IEEE
14 years 1 months ago
2005
IEEE
The space of images is known to be a non-linear subspace that is difficult to model. This paper derives an algorithm that walks within this space. We seek a manifold through the ...
COMPGEOM
2004
ACM
14 years 1 months ago
2004
ACM
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
3DOR
2008
13 years 10 months ago
2008
Shape deformations preserving the intrinsic properties of a surface are called isometries. An isometry deforms a surface without tearing or stretching it, and preserves geodesic d...
SGP
2007
13 years 10 months ago
2007
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
SGP
2004
13 years 10 months ago
2004
: We introduce a noise-resistant algorithm for reconstructing a watertight surface from point cloud data. It forms a Delaunay tetrahedralization, then uses a variant of spectral gr...