Geometric permutations of balls with bounded size disparity.
From MaRDI portal
Publication:1395572
DOI10.1016/S0925-7721(02)00169-4zbMath1039.52013MaRDI QIDQ1395572
Publication date: 1 July 2003
Published in: Computational Geometry (Search for Journal in Brave)
52B55: Computational aspects related to convexity
05A05: Permutations, words, matrices
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Some Discrete Properties of the Space of Line Transversals to Disjoint Balls, Helly numbers of acyclic families, Line transversals to disjoint balls, Helly-type theorems for line transversals to disjoint unit balls, INFLATING BALLS IS NP-HARD
Cites Work
- 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
- Geometric permutations of disjoint translates of convex sets
- The different ways of stabbing disjoint convex sets
- A constant bound for geometric permutations of disjoint unit balls
- Sharp bounds on geometric permutations of pairwise disjoint balls in \(\mathbb{R}^d\)
- A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}