International audienceIt 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
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
The original publication is available at www.springerlink.comInternational audienceA line L is a tra...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
A line L is a transversal to a family F of convex objects in R^d if it intersects every member of F....
International audienceWe prove Helly-type theorems for line transversals to disjoint unit balls in $...
SESSION: Session 8AInternational audienceWe prove that the set of directions of lines intersecting t...
International audienceWe characterize minimal configurations that pin a line in every $2$-plane
International audienceA line L is a transversal to a family F of convex objects in R^d if it interse...
International audienceA line L is a transversal to a family F of convex objects in R^d if it interse...
International audienceWe prove that the set of directions of lines intersecting three disjoint balls...
Attempts to generalize Helly's theorem to sets of lines intersecting convex sets led to a series of ...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
We prove that the set of directions of lines intersecting three disjoint balls in R3 in a given orde...
We prove that the maximum number of geometric permutations, induced by line transversals to a collec...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
The original publication is available at www.springerlink.comInternational audienceA line L is a tra...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
A line L is a transversal to a family F of convex objects in R^d if it intersects every member of F....
International audienceWe prove Helly-type theorems for line transversals to disjoint unit balls in $...
SESSION: Session 8AInternational audienceWe prove that the set of directions of lines intersecting t...
International audienceWe characterize minimal configurations that pin a line in every $2$-plane
International audienceA line L is a transversal to a family F of convex objects in R^d if it interse...
International audienceA line L is a transversal to a family F of convex objects in R^d if it interse...
International audienceWe prove that the set of directions of lines intersecting three disjoint balls...
Attempts to generalize Helly's theorem to sets of lines intersecting convex sets led to a series of ...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
The efficient resolution of various problems in computational geometry, for instance visibility comp...
We prove that the set of directions of lines intersecting three disjoint balls in R3 in a given orde...
We prove that the maximum number of geometric permutations, induced by line transversals to a collec...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...
The original publication is available at www.springerlink.comInternational audienceA line L is a tra...
International audienceWe present two new fundamental lower bounds on the worst-case combinatorial co...