2026-07-24T00:57:15Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5098 2024-03-06T10:35:55Z ddc:004 open_access

Building Efficient and Compact Data Structures for Simplicial Complexes Boissonnat, Jean-Daniel S., Karthik C. Tavenas, Sébastien Simplicial complex Compact data structures Automaton NP-hard 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Jean-Daniel Boissonnat and Karthik C. S. and Sébastien Tavenas 2015 Is Part Of LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SOCG.2015.642 urn:nbn:de:0030-drops-50981 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.642 eng https://creativecommons.org/licenses/by/3.0/legalcode