The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes

(1, 2) , (2, 1)
1
2

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

Dates and versions

hal-01108441 , version 1 (23-09-2016)

Identifiers

Cite

Jean-Daniel Boissonnat, Clément Maria. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. 20th Annual European Symposium, Ljubljana, Slovenia, September 10-12, 2012. Proceedings, Sep 2012, Ljubljana, Slovenia. pp.731-742, ⟨10.1007/978-3-642-33090-2_63⟩. ⟨hal-01108441⟩

Collections

INRIA INRIA2
272 View
163 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More