Ontology highlight
ABSTRACT:
SUBMITTER: Carvalho JF
PROVIDER: S-EPMC7924431 | biostudies-literature | 2018
REPOSITORIES: biostudies-literature
Carvalho J Frederico JF Vejdemo-Johansson Mikael M Kragic Danica D Pokorny Florian T FT
PeerJ. Computer science 20180528
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 <i>O</i>(|<i>S</i> <sup>(<i>n</i>-1)</sup>|) (where <i>S</i> <sup>(<i>n</i>-1)</sup> is the set of $(n-1)$-faces of $S$). We estimate the big- $O$ coefficient which depends on the dimension of $S$ and the implementation. We present an implementation, experimentally eval ...[more]