Building Efficient and Compact Data Structures for Simplicial Complexes

被引：9
|
作者：
Boissonnat, Jean-Daniel [1 ]
Karthik, C. S. [2 ]
Tavenas, Sebastien [3 ]
机构：
[1] INRIA Sophia Antipolis Mediterranee, Geometr, 2004 Route Lucioles,BP 93, F-06902 Sophia Antipolis, France
[2] Weizmann Inst Sci, Dept Comp Sci & Appl Math, Rehovot, Israel
[3] Microsoft Res India, Bangalore, Karnataka, India
来源：
ALGORITHMICA | 2017年 / 79卷 / 02期
基金：
欧洲研究理事会;
关键词：
Simplicial complex; Compact data structures; Automaton; NP-hard; AUTOMATA;
D O I：
10.1007/s00453-016-0207-y
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The Simplex Tree (ST) is a recently introduced data structure that can represent abstract simplicial complexes of any dimension and allows efficient implementation of a large range of basic operations on simplicial complexes. In this paper, we show how to optimally compress the ST while retaining its functionalities. In addition, we propose two new data structures called the Maximal Simplex Tree and the Simplex Array List. We analyze the compressed ST, the Maximal Simplex Tree, and the Simplex Array List under various settings.
引用
收藏
页码：530 / 567
页数：38
相关论文
共 50 条
12345