Data Structures for Simplicial Complexes: An Analysis And A Comparison

Floriani, Leila De; Hui, Annie

Data Structures for Simplicial Complexes: An Analysis And A Comparison

Files

119-128.pdf (242.16 KB)

Date

2005

Authors

Floriani, Leila De
Hui, Annie

Publisher

The Eurographics Association

Abstract

In this paper, we review, analyze and compare representations for simplicial complexes. We classify such representations, based on the dimension of the complexes they can encode, into dimension-independent structures, and data structures for three- and for two-dimensional simplicial complexes. We further classify the data structures in each group according to the basic kinds of the topological entities they represent. We present a description of each data structure in terms of the entities and topological relations encoded, and we evaluate it based on its expressive power, on its storage cost and on the efficiency in supporting navigation inside the complex, i.e., in retrieving topological relations not explicitly encoded. We compare the various data structures inside each category based on the above features.

        @inproceedings{:10.2312/SGP/SGP05/119-128
,
booktitle = {Eurographics Symposium on Geometry Processing 2005
},
editor = {Mathieu Desbrun and Helmut Pottmann
},
title = {{Data Structures for Simplicial Complexes: An Analysis And A Comparison
}},
author = {Floriani, Leila De and 
Hui, Annie
},
year = {2005
},
publisher = {The Eurographics Association
},
ISSN = {1727-8384
},
ISBN = {3-905673-24-X
},
DOI = {/10.2312/SGP/SGP05/119-128
}
}