单纯复形滤子的一种有效表示
An Efficient Representation for Filtrations of Simplicial Complexes
摘要:
单纯复形$K$上的过滤是$K$的单纯形的排序,使得排序中的所有前缀是$K$的子复形。过滤是持久同源的核心,持久同源是拓扑数据分析中的主要工具。为了表示单纯复形的过滤,整个过滤可以附加到任何明确存储复形的所有单纯形的数据结构,例如Hasse图或最近引入的单纯形树[Simplex '14]。然而,随着需要处理单纯复形的各种计算方法的流行,以及随着复形的大小的快速增加,找到仍然可以支持有效查询的紧凑数据结构的任务引起了极大的兴趣。在本文中,我们提出了一种新的数据结构称为临界单纯形图(CSD),这是一个变种的单纯形数组列表(SAL)[Simplica '17]。我们的数据结构允许以紧凑的方式存储单纯复形的过滤,并允许有效地实现大范围的基本操作。此外,我们证明,我们的数据结构是基本上最优的所需的存储空间。最后,我们表明,CSD表示承认快速建设算法的旗帜复杂和放松Delaunay复杂。
英文摘要:
A filtration over a simplicial complex $K$ is an ordering of the simplices of $K$ such that all prefixes in the ordering are subcomplexes of $K$. Filtrations are at the core of Persistent Homology, a major tool in Topological Data Analysis. In order to represent the filtration of a simplicial complex, the entire filtration can be appended to any data structure that explicitly stores all the simplices of the complex such as the Hasse diagram or the recently introduced Simplex Tree [Algorithmica '14]. However, with the popularity of various computational methods that need to handle simplicial complexes, and with the rapidly increasing size of the complexes, the task of finding a compact data structure that can still support efficient queries is of great interest. In this paper, we propose a new data structure called the Critical Simplex Diagram (CSD) which is a variant of the Simplex Array List (SAL) [Algorithmica '17]. Our data structure allows one to store in a compact way the filtration of a simplicial complex, and allows for the efficient implementation of a large range of basic operations. Moreover, we prove that our data structure is essentially optimal with respect to the requisite storage space. Finally, we show that the CSD representation admits fast construction algorithms for Flag complexes and relaxed Delaunay complexes.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。