Your browser doesn't support javascript.
loading
An algorithm for calculating top-dimensional bounding chains.
Carvalho, J Frederico; Vejdemo-Johansson, Mikael; Kragic, Danica; Pokorny, Florian T.
Afiliação
  • Carvalho JF; CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden.
  • Vejdemo-Johansson M; Mathematics Department, City University of New York, College of Staten Island, New York, NY, United States of America.
  • Kragic D; CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden.
  • Pokorny FT; CAS/RPL, KTH, Royal Institute of Technology, Stockholm, Sweden.
PeerJ Comput Sci ; 4: e153, 2018.
Article em En | MEDLINE | ID: mdl-33816807
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 estimate the big- $O$ coefficient which depends on the dimension of $S$ and the implementation. We present an implementation, experimentally evaluate the complexity of our algorithm, and compare its performance with that of solving the underlying linear system.
Palavras-chave

Texto completo: 1 Base de dados: MEDLINE Idioma: En Ano de publicação: 2018 Tipo de documento: Article

Texto completo: 1 Base de dados: MEDLINE Idioma: En Ano de publicação: 2018 Tipo de documento: Article