Sharp bounds on geometric permutations of pairwise disjoint balls in Rd

Authors:
Shakhar Smorodinsky;Joseph S. B. Mitchell;Micha Sharir
Affiliations:
School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel;Department of Applied Mathematics and Statistics, University at Stony Brook, NY;School of Mathematical Sciences, Tel Aviv University, Tel Aviv 69978, Israel and Courant Institute of Mathematical Sciences, New York University, New York, NY
Venue:
SCG '99 Proceedings of the fifteenth annual symposium on Computational geometry
Year:
1999

Citing 5
Cited 1

Geometric permutations of disjoint translates of convex sets

Discrete Mathematics
The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n - 2

Discrete & Computational Geometry
Permutations for convex sets

Discrete & Computational Geometry
The different ways of stabbing disjoint convex sets

Discrete & Computational Geometry
Line transversals of balls and smallest enclosing cylinders in three dimensions

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

A tight bound on the number of geometric permutations of convex fat objects in {\huge $\mathbf{\reals^d}$}

SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry

Quantified Score

Hi-index	0.00

Visualization

Abstract