The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes

Abstract

This paper introduces a data structure, called simplex tree, to represent abstract simplicial complexes of any dimension. All faces of the simplicial complex are explicitly stored in a trie whose nodes are in bijection with the faces of the complex. This data structure allows to efficiently implement a large range of basic operations on simplicial complexes. We provide theoretical complexity analysis as well as detailed experimental results. We more specifically study Rips and witness complexes.

Cited by in corpus (9)

• The Topology ToolKit
• Building Efficient and Compact Data Structures for Simplicial Complexes
• Finding self-similar behavior in quantum many-body dynamics via persistent homology
• The Stellar decomposition: A compact representation for simplicial complexes and beyond
• Euler Characteristic Curves and Profiles: a stable shape invariant for big data problems
• A Task-Parallel Approach for Localized Topological Data Structures
• The Implementation of the Colored Abstract Simplicial Complex and its Application to Mesh Generation
• Detecting Shearless Phase-Space Transport Barriers in Global Gyrokinetic Turbulence Simulations with Test Particle Map Models
• Quantum HodgeRank: Topology-Based Rank Aggregation on Quantum Computers