Coreduction Homology Algorithm

This paper presents a new reduction algorithm for the efficient computation of the homology of cubical sets and polotypes. The algorithm—particularly strong for low-dimensional sets embedded in high dimensions—runs in linear time. The paper presents the theoretical background of the algorithm, the a...

Full description

Saved in:
Bibliographic Details
Published inDiscrete & computational geometry Vol. 41; no. 1; pp. 96 - 118
Main Authors Mrozek, Marian, Batko, Bogdan
Format Journal Article
LanguageEnglish
Published New York Springer-Verlag 2009
Springer Nature B.V
Subjects
Online AccessGet full text

Cover

Loading…