Building Efficient and Compact Data Structures for Simplicial Complexes

Jean-Daniel Boissonnat, Karthik, Sébastien Tavenas, Jean-Daniel Boissonnat@inria, Fr
The Simplex Tree (ST) is a recently introduced data structure that can represent abstract sim-plicial 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 Sim-plex 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
more » ... lex Tree, and the Simplex Array List under various settings.