In this paper, we present an algorithm which allows to compute efficiently generators of the first homology group of a closed surface, orientable or not. Starting with an initial subdivision of a surface, we simplify it to its minimal form (minimal refers to the number of cells), while preserving its homology. Homology generators can thus be directly deduced from the minimal representation of the initial surface. Finally, we show how this algorithm can be used in a 3D labelled image in order to compute homology of each region described by its boundary. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Damiand, G., Peltier, S., & Fuchs, L. (2006). Computing homology for surfaces with generalized maps: Application to 3D images. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4292 LNCS-II, pp. 235–244). Springer Verlag. https://doi.org/10.1007/11919629_25
Mendeley helps you to discover research relevant for your work.