Computing homology generators for volumes using minimal generalized maps

Authors:
Guillaume Damiand;Samuel Peltier;Laurent Fuchs
Affiliations:
LaBRI, Université Bordeaux 1, UMR, CNRS, Talence Cedex, France;IFP, Rueil-Malmaison Cedex, France;SIC, Université de Poitiers, Futuroscope Chasseneuil Cedex, France
Venue:
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Year:
2008

Citing 4
Cited 1

Topological models for boundary representation: a comparison with n-dimensional generalized maps

Computer-Aided Design - Beyond solid modelling
Computing homology groups of simplicial complexes in R3

Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm

Journal of the ACM (JACM)
Computing homology for surfaces with generalized maps: application to 3d images

ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II

A fast algorithm to compute cohomology group generators of orientable 2-manifolds

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present an algorithm for computing efficiently homology generators of 3D subdivided orientable objects which can contain tunnels and cavities. Starting with an initial subdivision, represented with a generalized map where every cell is a topological ball, the number of cells is reduced using simplification operations (removal of cells), while preserving homology. We obtain a minimal representation which is homologous to the initial object. A set of homology generators is then directly deduced on the simplified 3D object.