A fast algorithm to compute cohomology group generators of orientable 2-manifolds
In this paper a fast algorithm to compute cohomology group generators of cellular decomposition of any orientable closed 2-manifold is presented. The presented algorithm is a dual version of algorithm to compute homology generators presented by David Eppstein [12] and developed by Jeff Erickson and...
| Autor: | |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2010 |
| 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/26213 |
| Acceso en línea: | http://hdl.handle.net/11441/26213 |
| Access Level: | acceso abierto |
| Palabra clave: | Computational cohomology Cohomology generators Combinatorial 2-manifold |
| Sumario: | In this paper a fast algorithm to compute cohomology group generators of cellular decomposition of any orientable closed 2-manifold is presented. The presented algorithm is a dual version of algorithm to compute homology generators presented by David Eppstein [12] and developed by Jeff Erickson and Kim Whittlesey [13]. |
|---|