| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Building Efficient and Compact Data Structures for Simplicial Complexes
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.
Cited literature [17 references]
https://hal.inria.fr/hal-01145407
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Monday, April 27, 2015 - 10:57:08 AM
Last modification on : Friday, April 30, 2021 - 10:05:01 AM
Long-term archiving on: : Monday, September 14, 2015 - 1:10:13 PM
Contributor : Jean-Daniel Boissonnat Connect in order to contact the contributor
Submitted on : Monday, April 27, 2015 - 10:57:08 AM
Last modification on : Friday, April 30, 2021 - 10:05:01 AM
Long-term archiving on: : Monday, September 14, 2015 - 1:10:13 PM
Files
simplexsocg.pdf
Files produced by the author(s)