On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

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

(1) , (2)
1
2
Marc Glisse

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 \emph{unit} balls has complexity $\Omega(n^4)$, which matches the trivial $O(n^4)$ upper bound. This improves the trivial $\Omega(n^2)$ bound and also the $\Omega(n^3)$ lower bound for the restricted setting of arbitrary-size balls [Devillers and Ramos, 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 $\Omega(n^3)$ lower bound on the complexity of the set of non-occluded lines among $n$ balls of arbitrary radii, improving on the trivial $\Omega(n^2)$ bound. This new bound almost matches the recent $O(n^{3+\epsilon})$ upper bound [Rubin, 2010].
Fichier principal
Vignette du fichier
HAL.pdf (420.65 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00442751 , version 1 (22-12-2009)
inria-00442751 , version 2 (17-03-2010)

Identifiers

  • HAL Id : inria-00442751 , version 2

Cite

Marc Glisse, Sylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. 26th annual symposium on Computational geometry - SoCG 2010, Jun 2010, Snowbird, Utah, United States. ⟨inria-00442751v2⟩
167 View
181 Download

Share

Gmail Facebook Twitter LinkedIn More