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.
Fichier principal
Algorithmica_ST.pdf (301.98 Ko)
Télécharger le fichier
simptree.png (43.74 Ko)
Télécharger le fichier
simptree.jpg (33.36 Ko)
Télécharger le fichier
Origin : Files produced by the author(s)
Format : Figure, Image
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Format : Figure, Image
Origin : Files produced by the author(s)
Origin : Files produced by the author(s)
Loading...