580 search results - page 41 / 116 » Manifold Clustering of Shapes |
CG
2011
Springer
13 years 2 days ago
2011
Springer
We propose a compact, dimension-independent data structure for manifold, non-manifold and non-regular simplicial complexes, that we call the Generalized Indexed Data structure wit...
SIGMOD
1998
ACM
14 years 22 days ago
1998
ACM
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
MICCAI
2007
Springer
14 years 9 months ago
2007
Springer
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
CGF
2004
13 years 8 months ago
2004
This paper describes a novel approach to the parameterization of triangle meshes representing 2-manifolds with an arbitrary genus. A topology-based decomposition of the shape is c...
CGF
2010
13 years 8 months ago
2010
A common operation in many geometry processing algorithms consists of finding correspondences between pairs of shapes by finding structure-preserving maps between them. A particul...