Geometric permutations of balls with bounded size disparity.

DOI10.1016/S0925-7721(02)00169-4zbMath1039.52013MaRDI QIDQ1395572

Subhash Suri, Yunhong Zhou

Publication date: 1 July 2003

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

geometric permutationscale factorline transversalradial ratio

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Permutations, words, matrices (05A05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (5)

INFLATING BALLS IS NP-HARD ⋮ Helly numbers of acyclic families ⋮ Line transversals to disjoint balls ⋮ Helly-type theorems for line transversals to disjoint unit balls ⋮ Some Discrete Properties of the Space of Line Transversals to Disjoint Balls

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}$}

This page was built for publication: Geometric permutations of balls with bounded size disparity.