Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation

Abstract. We describe a data structure for three-dimensional Nef complexes, algorithms for boolean operations on them, and our implementation of data structure and algorithms. Nef polyhedra were introduced by W. Nef in his seminal 1978 book on polyhedra. They are the closure of half-spaces under boolean operations and can represent non-manifold situations, open and closed boundaries, and mixed dimensional complexes. Our focus lies on the generality of the data structure, the completeness of the algorithms, and the exactness and efficiency of the implementation. In particular, all degeneracies are handled.

• Type: Conference
• Year: 2003
• Where: ESA
• Authors: Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, Michael Seel
• Keywords: Boolean Operations, Data Structure, ESA 2003, Three-dimensional Nef Complexes