Building Efficient and Compact Data Structures for Simplicial Complexes

Building Efficient and Compact Data Structures for Simplicial Complexes

0.00 Avg rating0 Votes
Article ID: iaor20173261
Volume: 79
Issue: 2
Start Page Number: 530
End Page Number: 567
Publication Date: Oct 2017
Journal: Algorithmica
Authors:
Keywords: datamining, optimization, computers: data-structure
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 ST while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree and the Simplex Array List. We analyze the compressed ST, the Maximal Simplex Tree, and the Simplex Array List under various settings.

Reviews

Required fields are marked *. Your email address will not be published.