Lower Bounds for Pinning Lines by Balls (Extended Abstract) - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2009

Lower Bounds for Pinning Lines by Balls (Extended Abstract)


It is known that if n>=2d pairwise disjoint balls in R^d have a unique line ℓ intersecting them in a given order <, one can always remove a ball so that ℓ remains the only line intersecting the balls in the order induced by <. We show that the constant 2d is best possible, in any dimension, and derive lower bounds on Helly numbers for sets of line transversals to disjoint balls in arbitrary dimension.
Fichier principal
Vignette du fichier
Pinning-Eurocomb09.pdf (83.92 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00431437 , version 1 (12-11-2009)



Otfried Cheong, Xavier Goaoc, Andreas Holmsen. Lower Bounds for Pinning Lines by Balls (Extended Abstract). European Conference on Combinatorics, Graph Theory and Applications - EuroComb 2009, Sep 2009, Bordeaux, France. pp.567-571, ⟨10.1016/j.endm.2009.07.094⟩. ⟨inria-00431437⟩
80 View
130 Download



Gmail Facebook X LinkedIn More