@conference {13258,
	title = {A decomposition-based representation for 3D simplicial complexes},
	booktitle = {Proceedings of the fourth Eurographics symposium on Geometry processing},
	series = {SGP {\textquoteright}06},
	year = {2006},
	month = {2006///},
	pages = {101 - 110},
	publisher = {Eurographics Association},
	organization = {Eurographics Association},
	address = {Aire-la-Ville, Switzerland, Switzerland},
	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.},
	isbn = {3-905673-36-3},
	url = {http://dl.acm.org/citation.cfm?id=1281957.1281970},
	author = {Hui,Annie and Vaczlavik,Lucas and De Floriani, Leila}
}
