Natan Rubin
Senior Academic
Improved bounds for geometric permutations
We show that the number of geometric permutations of an arbitrary collection of n pairwise disjoint convex sets in double-struck Rd, for d ≥ 3, is O(n2d-3 log n), improving Wenger's 20 years old bound of O(n2d-2).
| Publication language | English |
| Pages | 355-364 |
| Publication status | Published - 01.01.2010 |
| Article Number | 5671203 |
Keywords
Arrangements
Convex sets
Geometric permutations
Line transversals
ASJC Scopus subject areas
General Computer Science
