Bounding the Number of Geometric Permuta
β
Jacob E. Goodman; Richard Pollack; Rephael Wenger
π
Article
π
1996
π
Elsevier Science
π
English
β 352 KB
We prove that a suitably separated family of n compact convex sets in R d can be met by k-flat transversals in at most d&k) , or for fixed k and d, O(n k(k+1)(d&k) ) different order types. This is the first non-trivial upper bound for 12.