On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions

Abstract

We present two new fundamental lower bounds on the worst-case combinatorial complexity of sets of free lines and sets of maximal free line segments in the presence of balls in three dimensions. We first prove that the set of maximal non-occluded line segments among n disjoint unit balls has complexity Ω(n 4), which matches the trivial O(n 4) upper bound. This improves the trivial Ω(n 2) bound and also the Ω(n 3) lower bound for the restricted setting of arbitrary-size balls (Devillers and Ramos, personal communication, 2001). This result settles, negatively, the natural conjecture that this set of line segments, or, equivalently, the visibility complex, has smaller worst-case complexity for disjoint fat objects than for skinny triangles. We also prove an Ω(n 3) lower bound on the complexity of the set of non-occluded lines among n balls of arbitrary radii, improving on the trivial Ω(n 2) bound. This new bound almost matches the recent O(n 3+ε ) upper bound (Rubin, 26th Annual ACM Symposium on Computational Geometry—SCG’10, pp. 58–67, 2010).