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...
Saved in:
Published in | Discrete & computational geometry Vol. 41; no. 1; pp. 96 - 118 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
New York
Springer-Verlag
2009
Springer Nature B.V |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!