Building Efficient and Compact Data Structures for Simplicial Complexes

Jean Daniel Boissonnat, C. S. Karthik, Sébastien Tavenas

Research output: Contribution to journalArticlepeer-review

10 Scopus citations


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 ST while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree and the Simplex Array List. We analyze the compressed ST, the Maximal Simplex Tree, and the Simplex Array List under various settings.

Original languageEnglish (US)
Pages (from-to)530-567
Number of pages38
Issue number2
StatePublished - Oct 1 2017
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Computer Science Applications
  • Applied Mathematics


  • Automaton
  • Compact data structures
  • NP-hard
  • Simplicial complex


Dive into the research topics of 'Building Efficient and Compact Data Structures for Simplicial Complexes'. Together they form a unique fingerprint.

Cite this