On the Complexity of the k-Level in Arrangements of Pseudoplanes

M. Sharir, C. Ziv

A classical open problem in combinatorial geometry is to obtain tight asymptotic bounds on the maximum number of k-level vertices in an arrangement of n hyperplanes in d dimensions…