A Decomposition-based Representation for 3D Simplicial Complexes

Hui, Annie; Vaczlavik, Lucas; Floriani, Leila De

A Decomposition-based Representation for 3D Simplicial Complexes

Files

101-110.pdf (213.32 KB)

Date

2006

Authors

Hui, Annie
Vaczlavik, Lucas
Floriani, Leila De

Publisher

The Eurographics Association

Abstract

We define a new representation for non-manifold 3D shapes described by three-dimensional simplicial complexes, that we call the Double-Level Decomposition (DLD) data structure. The DLD data structure is based on a unique decomposition of the simplicial complex into nearly manifold parts, and encodes the decomposition in an efficient and powerful two-level representation. It is compact, and it supports efficient topological navigation through adjacencies. It also provides a suitable basis for geometric reasoning on non-manifold shapes. We describe an algorithm to decompose a 3D simplicial complex into nearly manifold parts. We discuss how to build the DLD data structure from a description of a 3D complex as a collection of tetrahedra, dangling triangles and wire edges, and we present algorithms for topological navigation. We present a thorough comparison with existing representations for 3D simplicial complexes.

        @inproceedings{:10.2312/SGP/SGP06/101-110
,
booktitle = {Symposium on Geometry Processing
},
editor = {Alla Sheffer and Konrad Polthier
},
title = {{A Decomposition-based Representation for 3D Simplicial Complexes
}},
author = {Hui, Annie and 
Vaczlavik, Lucas and 
Floriani, Leila De
},
year = {2006
},
publisher = {The Eurographics Association
},
ISSN = {1727-8384
},
ISBN = {3-905673-24-X
},
DOI = {/10.2312/SGP/SGP06/101-110
}
}