Building Efficient and Compact Data Structures for Simplicial Complexes
Computational Geometry
2016-11-08 v4 Data Structures and Algorithms
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.
Keywords
Cite
@article{arxiv.1503.07444,
title = {Building Efficient and Compact Data Structures for Simplicial Complexes},
author = {Jean-Daniel Boissonnat and Karthik C. S. and Sébastien Tavenas},
journal= {arXiv preprint arXiv:1503.07444},
year = {2016}
}
Comments
An extended abstract appeared in the proceedings of SoCG 2015