Abstract
In 2005, Goodman and Pollack introduced the concept of an allowable interval sequence, a combinatorial object which encodes properties of a family of pairwise disjoint convex sets in the plane. They, Dhandapani, and Holmsen used this concept to address Tverberg’s (1,k)-separation problem: How many pairwise disjoint compact convex sets in the plane are required to guarantee that one can be separated by a line from k others? (Denote this number by f k .) A new proof was provided that f 2=5, a result originally obtained by Tverberg himself, and the application of allowable interval sequences to the case of general k was left as an open problem. Hope and Katchalski, using other methods, proved in 1990 that 3k−1≤f k ≤12(k−1). In this paper, we apply the method of allowable interval sequences to give an upper bound on f k of under 7.2(k−1), shrinking the range given by Hope and Katchalski by more than half. For a family of translates we obtain a tighter upper bound of approximately 5.8(k−1).
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Alon, N., Katchalski, M., Pulleyblank, W.: Cutting disjoint disks by straight lines. Discrete Comput. Geom. 4, 239–243 (1989)
Czyzowicz, J., Rivera-Campo, E., Urrutia, J., Zaks, J.: Separating convex sets in the plane. Discrete Comput. Geom. 7, 189–195 (1992)
Dhandapani, R., Goodman, J., Holmsen, A., Pollack, R.: Interval sequences and the combinatorial encoding of planar families of pairwise disjoint convex sets. Rev. Roum. Math. Pures Appl. 50(5–6), 537–553 (2005)
Edelsbruner, H., Robison, A.D., Shen, X.: Covering convex sets with non-overlapping polygons. Discrete Math. 81(2), 153–164 (1990)
Edelsbruner, H., Sharir, M.: The maximum number of ways to stab n convex nonintersecting sets in the plane is 2n−2. Discrete Comput. Geom. 5, 35–42 (1990)
Fejes Tóth, L.: Lagerungen in der Ebene, auf der Kugel und im Raum. Springer, Berlin (1953)
Goodman, J.: Pseudoline arrangments. In: Goodman, J., O’Rourke, J. (eds.) Handbook of Discrete and Computational Geometry, 2nd edn., pp. 97–128. CRC Press, Boca Raton (2004)
Goodman, J., Pollack, R.: On the combinatorial classification of nondegenerate configurations in the plane. J. Comb. Theory, Ser. A 29, 220–235 (1980)
Goodman, J., Pollack, R.: The combinatorial encoding of disjoint convex sets in the plane. Combinatorica 28, 69–81 (2008)
Hope, R., Katchalski, M.: Separating plane convex sets. Math. Scand. 66, 44–46 (1990)
Lovasz, L., Vesztergombi, K., Wagner, U., Welzl, E.: Convex quadrilaterals and k-sets. In: Pach, J. (ed.) Towards a Theory of Geometric Graphs. Contemp. Math., vol. 342, pp. 139–148 (2004)
Pach, J., Pinchasi, R.: On the number of balanced lines. Discrete Comput. Geom. 25, 611–628 (2001)
Tverberg, H.: A separation property of plane convex sets. Math. Scand. 45, 255–260 (1979)
Ungar, P.: 2N noncollinear points determine at least 2N directions. J. Comb. Theory, Ser. A 33, 343–347 (1982)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Novick, M. Allowable Interval Sequences and Separating Convex Sets in the Plane. Discrete Comput Geom 47, 378–392 (2012). https://doi.org/10.1007/s00454-011-9365-5
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-011-9365-5