14,464 research outputs found
Incremental Computation of the Homology of Generalized Maps: An Application of Effective Homology Results
This paper deals with the incremental computation of the homology of " cellular " combinatorial structures, namely combinatorial maps and incidence graphs. " Incremental " is related to the operations which are applied to construct such structures: basic operations, i.e. the creation of cells and the identification of cells, are considered in the paper. Such incremental computation is done by applying results of effective homology [RS06]: a correspondence between the chain complex associated with a given combinatorial structure is maintained with a " smaller " chain complex , from which the homology groups and homology generators can be more efficiently computed
Homological computation using spanning trees
We introduce here a new F2 homology computation algorithm based on a generalization of the spanning tree technique on a finite 3-dimensional cell complex K embedded in ℝ3. We demonstrate that the complexity of this algorithm is linear in the number of cells. In fact, this process computes an algebraic map φ over K, called homology gradient vector field (HGVF), from which it is possible to infer in a straightforward manner homological information like Euler characteristic, relative homology groups, representative cycles for homology generators, topological skeletons, Reeb graphs, cohomology algebra, higher (co)homology operations, etc. This process can be generalized to others coefficients, including the integers, and to higher dimension
A Tool for Integer Homology Computation: Lambda-At Model
In this paper, we formalize the notion of lambda-AT-model (where is
a non-null integer) for a given chain complex, which allows the computation of
homological information in the integer domain avoiding using the Smith Normal
Form of the boundary matrices. We present an algorithm for computing such a
model, obtaining Betti numbers, the prime numbers p involved in the invariant
factors of the torsion subgroup of homology, the amount of invariant factors
that are a power of p and a set of representative cycles of generators of
homology mod p, for each p. Moreover, we establish the minimum valid lambda for
such a construction, what cuts down the computational costs related to the
torsion subgroup. The tools described here are useful to determine topological
information of nD structured objects such as simplicial, cubical or simploidal
complexes and are applicable to extract such an information from digital
pictures.Comment: Journal Image and Vision Computing, Volume 27 Issue 7, June, 200
Removal and Contraction Operations in D Generalized Maps for Efficient Homology Computation
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.Comment: Research repor
- …