Vertical Decomposition of Arrangements of Hyperplanes in Four Dimensions

We show that, for any collection H of n hyperplanes in ! 4 , the combinatorial complexity of the vertical decomposition of the arrangement A(H) of H is O(n 4 log n). The proof relies on properties of superimposed convex subdivisions of 3-space, and we also derive some other results concerning them