hal-00707901, version 2
The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes
N° RR-7993 (2012)
Résumé : 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
- Domaine : Informatique/Géométrie algorithmique
- Mots-clés : simplicial complexes – data structure – flag complexes – Rips complexes – witness complexes – relaxed witness complexes – high dimensions
- Référence interne : RR-7993
- Versions disponibles : v1 (15-06-2012) v2 (02-07-2012)
- hal-00707901, version 2
- http://hal.inria.fr/hal-00707901
- oai:hal.inria.fr:hal-00707901
- Contributeur :
- Soumis le : Lundi 2 Juillet 2012, 15:07:54
- Dernière modification le : Lundi 2 Juillet 2012, 16:29:12
Documents associés
Exporter