Journal
DISCRETE & COMPUTATIONAL GEOMETRY
Volume 41, Issue 1, Pages 96-118Publisher
SPRINGER
DOI: 10.1007/s00454-008-9073-y
Keywords
Homology algorithm; Cubical set; Reduction methods
Categories
Funding
- Polish MNSzW [N201 037 31/3151]
Ask authors/readers for more resources
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 algorithm itself, experimental results based on an implementation for cubical sets as well as some theoretical complexity estimates.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available