On Neighbors in Geometric Permutations.pptVIP

On Neighbors in Geometric Permutations Shakhar Smorodinsky Tel-Aviv University Joint work with Micha Sharir Geometric Permutations A - a set of disjoint convex bodies in Rd A line transversal l of A induces a geometric permutation of A Example An example of S with 2n-2 geometric permutations(Katchalski, Lewis, Zaks - 1985) Motivation? Trust me ……………. There is some! Problem Statement gd(A) = the number of geometric permutations of A gd(n) = max|A|=n{gd(A)} Known Facts g2(n) = 2n-2 (Edelsbrunner, Sharir 1990) gd(n) = ?(nd-1) (Katchalski, Lewis, Liu 1992) gd(n) = O(n2d-2) (Wenger 1990) Special cases: n arbitrary balls in Rd have at most ?(nd-1) GP’s (Smorodinsky, Mitchell, Sharir 1999) The ?(nd-1) bound extended to fat objects (Katz, Varadarajan 2001) n unit balls in Rd have at most O(1) GP’s (Zhou, Suri 2001) Overview of our result Define notion of “Neighbors” Neighbors Lemma: few neighbors = few permutations In the plane (d = 2) few neighbors Conjecture: few neighbors in higher dimensions (d 2) Definition A- a set of convex bodies in Rd A pair (bi, bj) in A are called neighbors If ? geometric permutation for which bi, bj appear consecutive: Neighbors Neighbors Neighbors Lemma In Rd, if N is the set of neighbor pairs of A, then gd(A)=O(|N|d-1). Neighbors Lemma (cont) In Rd, if N is the set of neighbor pairs of A, then gd(A)=O(|N|d-1). Consider the arrangement of great circles that correspond to hyperplanes in P. Conjecture: Upper Bound: #neighbors in the plane Neighbors Graph (cont) Neighbors Graph (cont) : However: there are no three pairwise crossing edges (technical proof) Further research Prove: O(n) neighbors in any fixed dimension. In the plane: Is the neighbors graph planar? * * l2 l1 1 2 3 l1: 1,2,3 l2: 2,3,1 3 1 2 1,2,3 2,3,1 2,1,3 1 2,3,…,n-2,1 3,..2,…,n-2,1 2 3 n-2 ? gd(n) ? 4 bi bj 1 2 3 n-2 Example (2,3) (2,4) ….. (2,n-2) No neighbors !!! b1 b2 h b1 b2 . h U