Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n - 2
Discrete & Computational Geometry
Discrete & Computational Geometry
The different ways of stabbing disjoint convex sets
Discrete & Computational Geometry
On stabbing lines for convex polyhedra in 3D
Computational Geometry: Theory and Applications
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Helly-type theorems and geometric transversals
Handbook of discrete and computational geometry
Geometric permutations of high dimensional spheres
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric permutations of balls with bounded size disparity
Computational Geometry: Theory and Applications - Special issue on the thirteenth canadian conference on computational geometry - CCCG'01
Geometric Permutations Induced by Line Transversals through a Fixed Point
Discrete & Computational Geometry
A Single Cell in an Arrangement of Convex Polyhedra in ${\Bbb R}^3$
Discrete & Computational Geometry
Geometric permutations of disjoint unit spheres
Computational Geometry: Theory and Applications
Line Transversals of Convex Polyhedra in $\mathbb{R}^3$
SIAM Journal on Computing
| Hi-index | 0.00 |
We show that the number of geometric permutations of an arbitrary collection of $n$ pairwise disjoint convex sets in ${\mathbb R}^d$, for $d\geq 3$, is $O(n^{2d-3}\log n)$, improving Wenger's 20-year-old bound of $O(n^{2d-2})$.