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

Marc Glisse 1 Sylvain Lazard 2
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée , Inria Saclay - Ile de France
2 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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].
Type de document :
Article dans une revue
Discrete and Computational Geometry, Springer Verlag, 2012, 47 (4), pp.756-772. 〈10.1007/s00454-012-9414-8〉
Liste complète des métadonnées

Littérature citée [23 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00643880
Contributeur : Sylvain Lazard <>
Soumis le : mercredi 23 novembre 2011 - 10:19:04
Dernière modification le : jeudi 9 février 2017 - 15:48:06
Document(s) archivé(s) le : vendredi 16 novembre 2012 - 11:51:35

Fichier

dcg_revised.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

Citation

Marc Glisse, Sylvain Lazard. On the Complexity of Sets of Free Lines and Line Segments Among Balls in Three Dimensions. Discrete and Computational Geometry, Springer Verlag, 2012, 47 (4), pp.756-772. 〈10.1007/s00454-012-9414-8〉. 〈hal-00643880〉

Partager

Métriques

Consultations de
la notice

439

Téléchargements du document

122