The Number of Generalized Balanced Lines
- First Online:
Let S be a set of r red points and b=r+2δ blue points in general position in the plane, with δ≥0. A line ℓ determined by them is balanced if in each open half-plane bounded by ℓ the difference between the number of blue points and red points is δ. We show that every set S as above has at least r balanced lines. The proof is a refinement of the ideas and techniques of Pach and Pinchasi (Discrete Comput. Geom. 25:611–628, 2001), where the result for δ=0 was proven, and introduces a new technique: sliding rotations.
KeywordsBalanced partitions Halving triangles Generalized Lower Bound Theorem Circular sequences Allowable sequences Sliding rotations
Unable to display preview. Download preview PDF.
- 1.Erdős, P., Lovász, L., Simmons, A., Strauss, E.G.: Dissection graphs on planar point sets. In: A Survey of Combinatorial Theory, pp. 139–149. North Holland, Amsterdam (1973) Google Scholar
- 2.Orden, D., Ramos, P., Salazar, G.: Balanced lines in two-coloured point sets. arXiv:0905.3380v1 [math.CO]
- 4.Sharir, M., Welzl, E.: Balanced lines, halving triangles, and the generalized lower bound theorem. In: Aronov, B., Basu, S., Pach, J., Sharir, M. (eds.) Discrete and Computational Geometry—The Goodman–Pollack Festschrift, pp. 789–798. Springer, Heidelberg (2003) Google Scholar