Efficient Computation of Simplicial Homology through Acyclic Matching

We consider the problem of efficiently computing homology with Z coefficients as well as homology generators for simplicial complexes of arbitrary dimension. We analyze, compare and discuss the equivalence of different methods based on combining reductions, co reductions and discrete Morse theory. W...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing S. 587 - 593
Hauptverfasser: Fugacci, Ulderico, Iuricich, Federico, De Floriani, Leila
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 01.09.2014
Schlagworte:
Data structures
Educational institutions
Encoding
Face
Generators
Shape
Vectors
ISBN:9781479984473, 1479984477
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We consider the problem of efficiently computing homology with Z coefficients as well as homology generators for simplicial complexes of arbitrary dimension. We analyze, compare and discuss the equivalence of different methods based on combining reductions, co reductions and discrete Morse theory. We show that the combination of these methods produces theoretically sound approaches which are mutually equivalent. One of these methods has been implemented for simplicial complexes by using a compact data structure for representing the complex and a compact encoding of the discrete Morse gradient. We present experimental results and discuss further developments.
ISBN:9781479984473
1479984477
DOI:10.1109/SYNASC.2014.84