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.
https://hal.inria.fr/hal-01145407
Contributeur : Jean-Daniel Boissonnat
<>
Soumis le : lundi 27 avril 2015 - 10:57:08
Dernière modification le : vendredi 21 septembre 2018 - 01:19:17
Document(s) archivé(s) le : lundi 14 septembre 2015 - 13:10:13
Jean-Daniel Boissonnat, Karthik C. S., Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes. International Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. International Symposium on Computational Geometry, 2015, 〈http://www.win.tue.nl/SoCG2015/〉. 〈10.4230/LIPIcs.SOCG.2015.642〉. 〈hal-01145407〉
