Homological computation using spanning trees
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 algebra...
| Autores: | , |
|---|---|
| Tipo de recurso: | capítulo de libro |
| Estado: | Versión enviada para evaluación y publicación |
| Fecha de publicación: | 2009 |
| País: | España |
| Institución: | Universidad de Sevilla (US) |
| Repositorio: | idUS. Depósito de Investigación de la Universidad de Sevilla |
| OAI Identifier: | oai:idus.us.es:11441/31975 |
| Acceso en línea: | http://hdl.handle.net/11441/31975 https://doi.org/10.1007/978-3-642-10268-4_32 |
| Access Level: | acceso abierto |
| Palabra clave: | Cell complex chain homotopy digital volume homology gradient vector field tree spanning tree |
| Sumario: | 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. |
|---|