51 search results - page 2 / 11 » Geometry, flows, and graph-partitioning algorithms |
PAMI
2006
13 years 5 months ago
2006
We provide evidence that non-linear dimensionality reduction, clustering and data set parameterization can be solved within one and the same framework. The main idea is to define ...
COMGEO
2008
ACM
13 years 5 months ago
2008
ACM
The flow complex is a geometric structure, similar to the Delaunay tessellation, to organize a set of (weighted) points in Rk. Flow shapes are topological spaces corresponding to ...
CACM
2008
13 years 5 months ago
2008
FGR
2008
IEEE
13 years 12 months ago
2008
IEEE
We describe an algorithm for automatically finding correspondences from face video sequences. This method is useful to many applications such as face tracking, face modeling and ...
CGF
1999
13 years 5 months ago
1999
We describe an approach for interactive collision detection and proximity computations on massive models composed of millions of geometric primitives. We address issues related to...