| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
Abstract : This paper introduces a new data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored in a trie whose nodes are in bijection with the faces of the complex. This data structure allows to efficiently imple- ment a large range of basic operations on simplicial complexes. We provide theoretical complexity analysis as well as detailed experimental results. We more specifically study Rips and witness complexes.
Cited literature [20 references]
https://hal.inria.fr/hal-01108441
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Friday, September 23, 2016 - 3:25:14 PM
Last modification on : Saturday, May 1, 2021 - 3:41:04 AM
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Friday, September 23, 2016 - 3:25:14 PM
Last modification on : Saturday, May 1, 2021 - 3:41:04 AM
Files
Algorithmica_ST.pdf
Files produced by the author(s)