Intersecting convex sets by rays (Q5896956)

What is the smallest number \(\tau=\tau(n)\) such that for any collection of \(n\) pairwise disjoint convex sets in \(d\)-dimensional Euclidean space there is a point such that any ray emanating from it meets at most \(\tau\) sets of the collection? The authors prove estimates for \(\tau\). For instance it is demonstrated that \(\tau\leq (dn+1)/(d+1)\). Particular attention is paid to special collections of convex sets in the plane (\(d=2\)).