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...

Full description

Saved in:

Bibliographic Details
Published in:	2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing pp. 587 - 593
Main Authors:	Fugacci, Ulderico, Iuricich, Federico, De Floriani, Leila
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2014
Subjects:	Data structures Educational institutions Encoding Face Generators Shape Vectors
ISBN:	9781479984473, 1479984477
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!