Removal and Contraction Operations in $n$D Generalized Maps for Efficient Homology Computation
Computer Vision and Pattern Recognition
2014-03-17 v1
Abstract
In this paper, we show that contraction operations preserve the homology of D generalized maps, under some conditions. Removal and contraction operations are used to propose an efficient algorithm that compute homology generators of D generalized maps. Its principle consists in simplifying a generalized map as much as possible by using removal and contraction operations. We obtain a generalized map having the same homology than the initial one, while the number of cells decreased significantly. Keywords: D Generalized Maps; Cellular Homology; Homology Generators; Contraction and Removal Operations.
Cite
@article{arxiv.1403.3683,
title = {Removal and Contraction Operations in $n$D Generalized Maps for Efficient Homology Computation},
author = {Guillaume Damiand and Rocio Gonzalez-Diaz and Samuel Peltier},
journal= {arXiv preprint arXiv:1403.3683},
year = {2014}
}
Comments
Research report