Removal operations in nD generalized maps for efficient homology computation

7Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we present an efficient way for computing homology generators of nD generalized maps. The algorithm proceeds in two steps: (1) cell removals reduces the number of cells while preserving homology; (2) homology generator computation is performed on the reduced object by reducing incidence matrices into their Smith-Agoston normal form. In this paper, we provide a definition of cells that can be removed while preserving homology. Some results on 2D and 3D homology generators computation are presented. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Damiand, G., Gonzalez-Diaz, R., & Peltier, S. (2012). Removal operations in nD generalized maps for efficient homology computation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7309 LNCS, pp. 20–29). https://doi.org/10.1007/978-3-642-30238-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free