论文标题
单纯形树：一般简单复合物的有效数据结构
The Simplex Tree: an Efficient Data Structure for General Simplicial Complexes
论文作者
论文摘要
本文介绍了称为单纯形树的数据结构，以表示任何维度的抽象简单复合物。简单络合物的所有面都明确存储在trie中，其节点与复合物的脸进行了两者的态度。这种数据结构允许在简单复合物上有效实施大量的基本操作。我们提供理论复杂性分析以及详细的实验结果。我们更具体地研究撕裂并见证复合体。
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.
