Cargando…
An algorithm for calculating top-dimensional bounding chains
We describe the Coefficient-Flow algorithm for calculating the bounding chain of an $(n-1)$-boundary on an $n$-manifold-like simplicial complex $S$. We prove its correctness and show that it has a computational time complexity of O(|S((n−1))|) (where S((n−1)) is the set of $(n-1)$-faces of $S$). We...
| Autores principales: | , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
PeerJ Inc.
2018
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7924431/ https://www.ncbi.nlm.nih.gov/pubmed/33816807 http://dx.doi.org/10.7717/peerj-cs.153 |