Fast, simple and separable computation of Betti numbers on three-dimensional cubical complexes
From MaRDI portal
Recommendations
Cites work
- An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
- CAPD::RedHom v2 -- homology software based on reduction algorithms
- Discrete Geometry for Computer Imagery
- Discrete Morse theoretic algorithms for computing homology of complexes and maps
- Distributed computation of coverage in sensor networks by homological methods
- Efficient Computation of Persistent Homology for Cubical Data
- scientific article; zbMATH DE number 4102053 (Why is no real title available?)
- scientific article; zbMATH DE number 799794 (Why is no real title available?)
- Index pairs algorithms
- Introduction to algorithms
- Morphological characterization of the diblock copolymer problem with topological computation
- Verified homology computations for nodal domains
Cited in
(3)
This page was built for publication: Fast, simple and separable computation of Betti numbers on three-dimensional cubical complexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2815194)