par Dujmović, Vida V.;Langerman, Stefan 
Référence Discrete & computational geometry, 49, 1, page (74-88)
Publication Publié, 2013
Référence Discrete & computational geometry, 49, 1, page (74-88)
Publication Publié, 2013
Article révisé par les pairs
| Résumé : | Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in ℝ2, there is a line ℓ such that in both line sets, for both halfplanes delimited by ℓ, there are √n lines which pairwise intersect in that halfplane, and this bound is tight; a centerpoint theorem: for any set of n lines there is a point such that for any halfplane containing that point there are √n/3 of the lines which pairwise intersect in that halfplane. We generalize those results in higher dimension and obtain a center transversal theorem, a same-type lemma, and a positive portion Erdo{double acute}s-Szekeres theorem for hyperplane arrangements. This is done by formulating a generalization of the center transversal theorem which applies to set functions that are much more general than measures. Back to graph drawing (and in the plane), we completely solve the open problem that motivated our search: there is no set of n labeled lines that are universal for all n-vertex labeled planar graphs. In contrast, the main result by Pach and Toth (J. Graph Theory 46(1):39-47, 2004), has, as an easy consequence, that every set of n (unlabeled) lines is universal for all n-vertex (unlabeled) planar graphs. © 2012 Springer Science+Business Media, LLC. |
