License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.SOCG.2015.642
URN: urn:nbn:de:0030-drops-50981
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2015/5098/
Boissonnat, Jean-Daniel ;
S., Karthik C. ;
Tavenas, Sébastien
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.
BibTeX - Entry
@InProceedings{boissonnat_et_al:LIPIcs:2015:5098,
author = {Jean-Daniel Boissonnat and Karthik C. S. and S{\'e}bastien Tavenas},
title = {{Building Efficient and Compact Data Structures for Simplicial Complexes}},
booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)},
pages = {642--656},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-83-5},
ISSN = {1868-8969},
year = {2015},
volume = {34},
editor = {Lars Arge and J{\'a}nos Pach},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2015/5098},
URN = {urn:nbn:de:0030-drops-50981},
doi = {10.4230/LIPIcs.SOCG.2015.642},
annote = {Keywords: Simplicial complex, Compact data structures, Automaton, NP-hard}
}
|
Keywords: |
|
Simplicial complex, Compact data structures, Automaton, NP-hard |
|
Collection: |
|
31st International Symposium on Computational Geometry (SoCG 2015) |
|
Issue Date: |
|
2015 |
|
Date of publication: |
|
12.06.2015 |
