TY - JOUR
AB - 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.
AU - Edelsbrunner, Herbert
AU - Sharir, Micha
ID - 4068
IS - 1
JF - Discrete & Computational Geometry
SN - 0179-5376
TI - The maximum number of ways to stabn convex nonintersecting sets in the plane is 2n−2
VL - 5
ER -