584 search results - page 10 / 117 » On the Number of Halving Planes |
DM
2006
13 years 8 months ago
2006
Let F be a family of translates of a fixed convex set M in Rn. Let (F) and (F) denote the transversal number and the independence number of F, respectively. We show that (F) (F) 8...
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices ...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We prove a lower bound of 0.3288 n 4¡ for the rectilinear crossing number cr(Kn) of a complete graph on n vertices, or in other words, for the minimum number of convex quadril...
DCG
2010
13 years 8 months ago
2010
Let S be a set of r red points and b = r +2 blue points in general position in the plane. A line determined by them is said to be balanced if in each open half-plane bounded by th...
ENDM
2008
13 years 8 months ago
2008
We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...