CAPD::RedHom - Reduction heuristics for homology algorithms
|Published in||Image-A : Applicable Mathematics in Image Engineering, 4 (7)|
|Abstract||We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith ...
We present an efficient software package for computing homology of sets, maps and filtrations represented as cubical, simplicial and regular CW complexes. The core homology computation is based on classical Smith diagonalization, but the efficiency of our approach comes from applying several geometric and algebraic reduction techniques combined with smart implementation.
This item appears in the following collection(s)
Except where otherwise noted, this item's license is described as: Atribución-NoComercial-SinDerivadas 4.0 España
Showing items related by title, author, creator and subject.
Álvarez Solano, Víctor; Frau García, María Dolores; Real Jurado, Pedro; Armario Sampalo, José Andrés (2012)
Let G be a semidirect product of finitely generated Abelian groups. We provide a method for constructing an explicit ...
Real Jurado, Pedro; Molina Abril, Helena; González Lorenzo, Aldo; Bac, Alexandra; Mari, Jean-Luc (2015)
This paper analyses the topological information of a digital object O under a combined combinatorial-algebraic point of ...
Pilarczyk, Pawel; Real Jurado, Pedro (2015)
We introduce algorithms for the computation of homology, cohomology, and related operations on cubical cell complexes, ...