Skip to Main content Skip to Navigation
Conference papers

Building Efficient and Compact Data Structures for Simplicial Complexes

Jean-Daniel Boissonnat 1, * C. S. Karthik 2 Sébastien Tavenas 3
* Corresponding author
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
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 Maximal Simplex Tree (MxST) and Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.
Document type :
Conference papers
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Monday, April 27, 2015 - 10:57:08 AM
Last modification on : Friday, April 30, 2021 - 10:05:01 AM
Long-term archiving on: : Monday, September 14, 2015 - 1:10:13 PM


Files produced by the author(s)




Jean-Daniel Boissonnat, C. S. Karthik, Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes. International Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. ⟨10.4230/LIPIcs.SOCG.2015.642⟩. ⟨hal-01145407⟩



Record views


Files downloads