Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
An algorithm for calculating top-dimensional bounding chains
KTH, School of Electrical Engineering and Computer Science (EECS), Robotics, perception and learning, RPL.ORCID iD: 0000-0002-8750-0897
CUNY, Math Dept, Coll Staten Isl, New York, NY 10021 USA..
KTH, School of Electrical Engineering and Computer Science (EECS), Robotics, perception and learning, RPL.ORCID iD: 0000-0003-2965-2953
KTH, School of Electrical Engineering and Computer Science (EECS), Robotics, perception and learning, RPL.ORCID iD: 0000-0003-1114-6040
2018 (English)In: PEERJ COMPUTER SCIENCE, ISSN 2376-5992, article id e153Article in journal (Refereed) Published
Abstract [en]

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(vertical bar S(n-1)vertical bar) (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.

Place, publisher, year, edition, pages
PEERJ INC , 2018. article id e153
Keywords [en]
Homology, Computational algebraic topology
National Category
Computational Mathematics
Identifiers
URN: urn:nbn:se:kth:diva-232420DOI: 10.7717/peerj-cs.153ISI: 000437236300001OAI: oai:DiVA.org:kth-232420DiVA, id: diva2:1235328
Funder
Knut and Alice Wallenberg FoundationSwedish Research Council
Note

QC 20180725

Available from: 2018-07-25 Created: 2018-07-25 Last updated: 2019-04-12Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full text

Authority records BETA

Carvalho, Joao FredericoKragic, DanicaPokorny, Florian T.

Search in DiVA

By author/editor
Carvalho, Joao FredericoKragic, DanicaPokorny, Florian T.
By organisation
Robotics, perception and learning, RPL
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 176 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf