Repositorio de producción científica de la Universidad de Sevilla

Homological computation using spanning trees

 

Advanced Search
 
Opened Access Homological computation using spanning trees
Cites

Show item statistics
Icon
Export to
Author: Molina Abril, Helena
Real Jurado, Pedro
Department: Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII)
Date: 2009
Published in: Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications, Lecture Notes in Computer Science, Vol. 5856 p. 272-278
Document type: Chapter of Book
Abstract: We 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 dimension.
Size: 191.4Kb
Format: PDF

URI: http://hdl.handle.net/11441/31975

DOI: http://dx.doi.org/10.1007/978-3-642-10268-4_32

This work is under a Creative Commons License: 
Atribución-NoComercial-CompartirIgual 4.0 Internacional

This item appears in the following Collection(s)