hal-00707901, version 1
The Simplex Tree: An Efficient Data Structure for General Simplicial Complexes
N° RR-7993 (2012)
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 implement 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.
- 1:
- INRIA
- 2:
- École normale supérieure de Cachan - ENS Cachan
- Domain : Computer Science/Computational Geometry
- Keywords : simplicial complexes – data structure – flag complexes – Rips complexes – witness complexes – relaxed witness complexes – high dimensions
- Internal note : RR-7993
- Available versions : v1 (2012-06-15) v2 (2012-07-02)
- hal-00707901, version 1
- http://hal.inria.fr/hal-00707901
- oai:hal.inria.fr:hal-00707901
- From:
- Submitted on: Thursday, 14 June 2012 16:51:45
- Updated on: Friday, 22 June 2012 14:30:23
Associated documents
Export