Show simple item record

Chapter of Book

dc.creatorMolina Abril, Helena
dc.creatorReal Jurado, Pedro
dc.description.abstractWe introduce here a new F2 homology computation algorithm based on a generalization of the spanning tree technique on a finite 3-dimensional cell complex K embedded in ℝ3. We demonstrate that the complexity of this algorithm is linear in the number of cells. In fact, this process computes an algebraic map φ over K, called homology gradient vector field (HGVF), from which it is possible to infer in a straightforward manner homological information like Euler characteristic, relative homology groups, representative cycles for homology generators, topological skeletons, Reeb graphs, cohomology algebra, higher (co)homology operations, etc. This process can be generalized to others coefficients, including the integers, and to higher
dc.relation.ispartofProgress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Lecture Notes in Computer Science, Vol. 5856 p. 272-278es
dc.rightsAtribución-NoComercial-CompartirIgual 4.0 Internacional*
dc.subjectCell complex chain homotopy digital volume homology gradient vector field tree spanning treees
dc.titleHomological computation using spanning treeses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)es

Homological computing.pdf191.4KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

Atribución-NoComercial-CompartirIgual 4.0 Internacional
Except where otherwise noted, this item's license is described as: Atribución-NoComercial-CompartirIgual 4.0 Internacional