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
Shape sensitive geometric permutations
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Geometric permutations of high dimensional spheres
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Shape sensitive geometric complexity
Shape sensitive geometric complexity
Minimizing the stabbing number of matchings, trees, and triangulations
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
| Hi-index | 0.00 |
The recent results that n congruent balls in &8477;d have at most 4 distinct geometric permutations is described.