Orthogonal Polyhedra: Representation and Computation

Abstract. In this paper we investigate orthogonal polyhedra, i.e. polyhedra which are finite unions of full-dimensional hyper-rectangles. We define representation schemes for these polyhedra based on their vertices, and show that these compact representation schemes are canonical for all (convex and non-convex) polyhedra in any dimension. We then develop efficient algorithms for membership, face-detection and Boolean operations for these representations.

• Type: Conference
• Year: 1999
• Where: HYBRID
• Authors: Olivier Bournez, Oded Maler, Amir Pnueli
• Keywords: Control Systems, HYBRID 1999, Orthogonal Polyhedra, Polyhedra, Representation Schemes