A New Technique for Analyzing Substructures in Arrangements

We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in higher dimensions. We apply the technique (a) to derive new and simpler proofs ofthe known bounds on the complexity of the lower envelope, of a single cell, or of a zone in arrangements of simplices in higher dimensions, and (b) to obtain improved bounds on the complexity of the vertical decomposition of a single cell in an arrangement of triangles in 3-space, and of several other substructures in such an arrangement (the entire arrangement, all nonconvex cells, and any collection of cells). The latter results also lead to improved algorithms for computing substructures in arrangements of triangles and for translational motion planning in three dimensions.

• Type: Conference
• Year: 1995
• Where: COMPGEOM
• Authors: Boaz Tagansky
• Keywords: Combinatorial Complexity, COMPGEOM 1995, Discrete Geometry, Single Cell, Various Substructures