Building Efficient and Compact Data Structures for Simplicial Complexes - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Building Efficient and Compact Data Structures for Simplicial Complexes

(1) , (2) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
simplexsocg.pdf (663.65 Ko) Télécharger le fichier
Vignette du fichier
fig.jpg (21.44 Ko) Télécharger le fichier
Vignette du fichier
fig.png (51.1 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-01145407 , version 1 (27-04-2015)

Identifiers

Cite

Jean-Daniel Boissonnat, C. S. Karthik, Sébastien Tavenas. Building Efficient and Compact Data Structures for Simplicial Complexes. International Symposium on Computational Geometry 2015, Jun 2015, Eindhoven, Netherlands. ⟨10.4230/LIPIcs.SOCG.2015.642⟩. ⟨hal-01145407⟩
177 View
272 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More