An iterative algorithm for homology computation on simplicial shapes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Computer-Aided Design Year : 2011

An iterative algorithm for homology computation on simplicial shapes


We propose a new iterative algorithm for computing the homology of arbitrary shapes discretized through simplicial complexes, We demonstrate how the simplicial homology of a shape can be effectively expressed in terms of the homology of its sub-components. The proposed algorithm retrieves the complete homological information of an input shape including the Betti numbers, the torsion coefficients and the representative homology generators. To the best of our knowledge, this is the first algorithm based on the constructive Mayer-Vietoris sequence, which relates the homology of a topological space to the homologies of its sub-spaces, i.e. the sub-components of the input shape and their intersections. We demonstrate the validity of our approach through a specific shape decomposition, based only on topological properties, which minimizes the size of the intersections between the sub-components and increases the efficiency of the algorithm.
Fichier principal
Vignette du fichier
CAD_homology.pdf (981.26 Ko) Télécharger le fichier
Vignette du fichier
carter_homology.png (338.07 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image

Dates and versions

hal-00644410 , version 1 (24-11-2011)
hal-00644410 , version 2 (28-11-2011)



Dobrina Boltcheva, David Canino, Sara Merino Aceituno, Jean-Claude Léon, Leila de Floriani, et al.. An iterative algorithm for homology computation on simplicial shapes. Computer-Aided Design, 2011, Solid and Physical Modeling 2011, 43 (11), pp.1457-1467. ⟨10.1016/j.cad.2011.08.015⟩. ⟨hal-00644410v2⟩
555 View
1254 Download



Gmail Facebook X LinkedIn More