mlsanityData to 7 Oct 2026

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

arXiv 2001.02581 ↗First posted 8 Jan 2020cs.CGcited by 14

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jan 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 6; 2022: 2; 2023: 0; 2024: 3; 2025: 2; 2026: 1.

14 papers.

Sort: