Skip to Main content Skip to Navigation
Journal articles

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

Jean-Daniel Boissonnat 1 Clément Maria 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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.
Document type :
Journal articles
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download


https://hal.inria.fr/hal-01108416
Contributor : Jean-Daniel Boissonnat <>
Submitted on : Monday, October 24, 2016 - 11:29:46 PM
Last modification on : Saturday, January 27, 2018 - 1:31:23 AM

Files

Algorithmica_ST.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Jean-Daniel Boissonnat, Clément Maria. The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes. Algorithmica, Springer Verlag, 2014, 70 (3), pp.406-427. ⟨10.007/s00453-014-9887-3⟩. ⟨hal-01108416⟩

Share

Metrics

Record views

402

Files downloads

508