We show that, for any collection H of n hyperplanes in R(4), the combi
natorial complexity of the vertical decomposition of the arrangement A
(H) of H is O(n(4) log n). The proof relies on properties of superimpo
sed convex subdivisions of 3-space, and we also derive some other resu
lts concerning them.