Buscar
Mostrando ítems 1-3 de 3
Artículo
Computing Adem Cohomology Operations
(Cornell University, 2006)
We deal with the problem of obtaining explicit simplicial formu- lae defining the classical Adem cohomology operations at the cochain level. Having these formulae at hand, we design an algorithm for com- puting these ...
Artículo
Parallel connected-Component-Labeling based on homotopy trees
(Elsevier, 2020)
Taking advantage of the topological and isotopic properties of binary digital images, we present here anew algorithm for connected component labeling (CLL). A local-to-global treatment of the topologicalinformation within ...
Artículo
Allowing cycles in discrete Morse theory
(Elsevier, 2017)
Discrete gradient vector fields are combinatorial structures that can be used for accelerating the homology computation of CW complexes, such as simplicial or cubical complexes, by reducing their number of cells. Consequently, ...