Building Efficient and Compact Data Structures for Simplicial Complexes
Boissonnat, Jean-Daniel, C. S. Karthik, Sébastien Tavenas · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2015
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.