A fast algorithm to compute cohomology group generators of orientable 2-manifolds

  • Authors:
  • Paweł DłOtko

  • Affiliations:
  • Institute of Computer Science, Jagiellonian University, Łojasiewicza 6, 30-348 Kraków, Poland

  • Venue:
  • Pattern Recognition Letters
  • Year:
  • 2012

Quantified Score

Hi-index 0.10

Visualization

Abstract

In this paper a fast algorithm to compute cohomology group generators of cellular decomposition of any orientable open or closed 2-manifold is described. The presented algorithm is a dual version of algorithm to compute homology generators presented by David Eppstein in ''Dynamic generators of topologically embedded graphs'' and developed by Jeff Erickson and Kim Whittlesey in ''Greedy optimal homotopy and homology generators''. Some parts of the paper bases on ideas presented in ''Optimal discrete Morse functions for 2-manifolds'' by Thomas Lewiner, Helio Lopes and Geovan Tavares. Extension of the algorithm to some non-manifold cases is provided.