Dynamic generators of topologically embedded graphs
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimal discrete Morse functions for 2-manifolds
Computational Geometry: Theory and Applications
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Meshless Thin-Shell Simulation Based on Global Conformal Parameterization
IEEE Transactions on Visualization and Computer Graphics
Homology algorithm based on acyclic subspace
Computers & Mathematics with Applications
Coreduction Homology Algorithm
Discrete & Computational Geometry
Directly computing the generators of image homology using graph pyramids
Image and Vision Computing
Irregular Graph Pyramids and Representative Cocycles of Cohomology Generators
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Computing homology generators for volumes using minimal generalized maps
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Critical Analysis of the Spanning Tree Techniques
SIAM Journal on Numerical Analysis
Computing homology for surfaces with generalized maps: application to 3d images
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Hi-index | 0.10 |
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.