Building Efficient and Compact Data Structures for Simplicial Complexe - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Algorithmica Year : 2016

Building Efficient and Compact Data Structures for Simplicial Complexe

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 the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressed Simplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings.
Fichier principal
Vignette du fichier
Journal-final.pdf (496.92 Ko) Télécharger le fichier
Vignette du fichier
vignette.png (83.29 Ko) Télécharger le fichier
Vignette du fichier
vignette.jpg (41.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Format Figure, Image
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01364648 , version 1 (12-09-2016)

Identifiers

Cite

Jean-Daniel Boissonnat, Karthik C. Srikanta, Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexe. Algorithmica, 2016, ⟨10.1007/s00453-016-0207-y⟩. ⟨hal-01364648⟩
277 View
221 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More