Document Open Access Logo

Building Efficient and Compact Data Structures for Simplicial Complexes

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

PDF

File

Thumbnail PDF
PDF
LIPIcs.SOCG.2015.642.pdf
  • Filesize: 0.59 MB
  • 16 pages

Document Identifiers

Subject Classification

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

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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.

Cite As Get BibTex

Jean-Daniel Boissonnat, Karthik C. S., and Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 642-657, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015) https://doi.org/10.4230/LIPIcs.SOCG.2015.642

Author Details

Jean-Daniel Boissonnat
Karthik C. S.
Sébastien Tavenas
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact