Skip to Main content Skip to Navigation
Journal articles

Building Efficient and Compact Data Structures for Simplicial Complexe

Jean-Daniel Boissonnat 1 Karthik C. Srikanta 2 Sébastien Tavenas 3 
1 DATASHAPE - Understanding the Shape of Data
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
3 MC2 - Modèles de calcul, Complexité, Combinatoire
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the Simplex Tree while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.
Document type :
Journal articles
Complete list of metadata

Cited literature [27 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Monday, September 12, 2016 - 5:13:57 PM
Last modification on : Friday, February 4, 2022 - 3:14:55 AM
Long-term archiving on: : Tuesday, December 13, 2016 - 3:46:46 PM


Files produced by the author(s)



Jean-Daniel Boissonnat, Karthik C. Srikanta, Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexe. Algorithmica, Springer Verlag, 2016, ⟨10.1007/s00453-016-0207-y⟩. ⟨hal-01364648⟩



Record views


Files downloads