@article{4068,
abstract = {LetS be a collection ofn convex, closed, and pairwise nonintersecting sets in the Euclidean plane labeled from 1 ton. A pair of permutations
(i1i2in−1in)(inin−1i2i1)
is called ageometric permutation of S if there is a line that intersects all sets ofS in this order. We prove thatS can realize at most 2n–2 geometric permutations. This upper bound is tight.},
author = {Edelsbrunner, Herbert and Sharir, Micha},
issn = {1432-0444},
journal = {Discrete & Computational Geometry},
number = {1},
pages = {35 -- 42},
publisher = {Springer},
title = {{The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2}},
doi = {10.1007/BF02187778},
volume = {5},
year = {1990},
}