Geometric permutations of higher dimensional spheres
From MaRDI portal
Publication:1883581
DOI10.1016/j.comgeo.2004.03.011zbMath1064.52007MaRDI QIDQ1883581
Danny Z. Chen, Jinhui Xu, Yingping Huang
Publication date: 13 October 2004
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2004.03.011
52B55: Computational aspects related to convexity
52A35: Helly-type theorems and geometric transversal theory
52C45: Combinatorial complexity of geometric structures
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Upper bounds on geometric permutations for convex sets
- The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n-2
- The different ways of stabbing disjoint convex sets
- Line transversals of balls and smallest enclosing cylinders in three dimensions
- Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
- Geometric permutations for convex sets
- A tight bound on the number of geometric permutations of convex fat objects in \(\mathbb{R}^d\)