Repository landing page
Building Efficient and Compact Data Structures for Simplicial Complexe
Abstract
International audienceThe Simplex Tree (ST) is a recently introduced data structurethat can represent abstract simplicial complexes of any dimension andallows efficient implementation of a large range of basic operations onsimplicial complexes. In this paper, we show how to optimally compressthe Simplex Tree while retaining its functionalities. In addition, wepropose two new data structures called the Maximal Simplex Tree (MxST) and the Simplex Array List (SAL). We analyze the compressedSimplex Tree, the Maximal Simplex Tree, and the Simplex Array List under various settings- info:eu-repo/semantics/article
- Journal articles
- Simplicial complex
- Compact data structures
- Automaton
- NP-hard
- ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.2: Geometrical problems and computations
- ACM: F.: Theory of Computation/F.2: ANALYSIS OF ALGORITHMS AND PROBLEM COMPLEXITY/F.2.2: Nonnumerical Algorithms and Problems/F.2.2.1: Computations on discrete structures
- [INFO.INFO-CG]Computer Science [cs]/Computational Geometry [cs.CG]
Similar works
This paper was published in Hal-Diderot.
Having an issue?
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.