The Maximal Number of Geometric Permutations for n Disjoint Translates of a Convex Set in ℝ Is Ω(n)

A geometric permutation induced by a transversal line of a finite family of disjoint convex sets in ℝ^d is the order in which the transversal meets the members of the family. It is known that the maximal number of geometric permutations in families of n disjoint translates of a convex set in ℝ³ is 3. We prove that for d ≥ 3 the maximal number of geometric permutations for such families in ℝ^d is Ω(n).