1 paper
Haim Kaplan, Natan Rubin, Micha Sharir
We establish a bound of $O(n^2k^{1+\eps})$, for any $\eps>0$, on the combinatorial complexity of the set $\T$ of line transversals of a collection ¶ of k convex polyhedra in $\…