论文信息 - Computing Homology Generators for Volumes Using Minimal Generalized Maps

Computing Homology Generators for Volumes Using Minimal Generalized Maps

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.

Guillaume Damiand | Laurent Fuchs | Samuel Peltier

[1] Guillaume Damiand,et al. Computing Homology for Surfaces with Generalized Maps: Application to 3D Images , 2006, ISVC.

[2] J. Craggs. Applied Mathematical Sciences , 1973 .

[3] Tamal K. Dey,et al. Computing homology groups of simplicial complexes in R3 , 1998, JACM.

[4] Pascal Lienhardt,et al. Topological models for boundary representation: a comparison with n-dimensional generalized maps , 1991, Comput. Aided Des..

[5] Frank Harary,et al. The Irregularity Cost of a Graph , 1997 .

[6] PASCAL LIENHARDT,et al. N-Dimensional Generalized Combinatorial Maps and Cellular Quasi-Manifolds , 1994, Int. J. Comput. Geom. Appl..

[7] K DeyTamal,et al. Computing homology groups of simplicial complexes in R3 , 1998 .

[8] R. Ho. Algebraic Topology , 2022 .

[9] 坂上貴之. 書評 Computational Homology , 2005 .

[10] Guillaume Damiand,et al. Removal and Contraction for n-Dimensional Generalized Maps , 2003, DGCI.

[11] Robert E. Tarjan,et al. Efficiency of a Good But Not Linear Set Union Algorithm , 1972, JACM.

[12] M. Mrozek,et al. Homology Computation by Reduction of Chain Complexes , 1998 .