Abstract

In this paper, we prove that the maximum number of geometric permutations (induced by line transversals) of a set of n pairwise disjoint spheres with a bounded radius ratio in R d for d⩾3 is at most 2 ⌊ 2 M⌋+1 , where M is the ratio of the largest radius and the smallest radius of the spheres. Setting M to 1, this gives an upper bound of 4 on the maximum number of geometric permutations for congruent spheres in R d , matching a recently independently discovered result [Y. Zhou, S. Suri, in: Proc. of 12th Annual ACM-SIAM Symp. on Discrete Algorithms, 2001, pp. 234–243] on this case. Our result settles a conjecture in combinatorial geometry.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.