Fast, Simple and Separable Computation of Betti Numbers on Three-dimensional Cubical Complexes

Abstract : Betti numbers are topological invariants that count the number of holes of each dimension in a space. Cubical complexes are a class of CW complex whose cells are cubes of different dimensions such as points, segments, squares, cubes, etc. They are particularly useful for modeling structured data such as binary volumes. We introduce a fast and simple method for computing the Betti numbers of a three-dimensional cubical complex that takes advantage on its regular structure, which is not possible with other types of CW complexes such as simplicial or polyhedral complexes. This algorithm is also restricted to three-dimensional spaces since it exploits the Euler-Poincaré formula and the Alexander duality in order to avoid any matrix manipulation. The method runs in linear time on a single core CPU. Moreover, the regular cubical structure allows us to obtain an efficient implementation for a multi-core architecture.
Complete list of metadatas

https://hal-amu.archives-ouvertes.fr/hal-01341014
Contributor : Jean-Luc Mari <>
Submitted on : Thursday, February 23, 2017 - 12:04:19 PM
Last modification on : Saturday, June 29, 2019 - 9:10:03 PM
Long-term archiving on : Wednesday, May 24, 2017 - 1:26:53 PM

File

CTIC2016.compressed.pdf
Files produced by the author(s)

Identifiers

Citation

Aldo Gonzalez-Lorenzo, Mateusz Juda, Alexandra Bac, Jean-Luc Mari, Pedro Real. Fast, Simple and Separable Computation of Betti Numbers on Three-dimensional Cubical Complexes. 6th International Workshop on Computational Topology in Image Context (CTIC 2016), Jun 2016, Marseille, France. pp.130-139, ⟨10.1007/978-3-319-39441-1_12⟩. ⟨hal-01341014⟩

Share

Metrics

Record views

208

Files downloads

457