Building efficient and compact data structures for simplicial complexes
JD Boissonnat, CS Karthik, S Tavenas - Algorithmica, 2017 - Springer
JD Boissonnat, CS Karthik, S Tavenas
Algorithmica, 2017•SpringerAbstract 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 …
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 …
Abstract
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.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果