Abstract
Let n,m,k,h be positive integers such that 1 ≤ n ≤ m, 1≤ k ≤ n and 1≤ h ≤ m. Then we give a necessary and sufficient condition for a configuration with n red points and m blue points on a line to have an interval containing precisely k red points and h blue points.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bárány, I., Matoušek, J.: Simultaneous partitions of measures by k-fans. Discrete Comput. Geom. 25, 317–334 (2001)
Goodman, J., O’Rourke, J.: Handbook of Discrete and Computational Geometry. CRC Press, Boca Raton (1997)
Kaneko, A., Kano, M.: Discrete geometry on red and blue points in the plane — A survey. In: Discrete and Computational GeometryE The Goodman-Pollack Festschrift, pp. 551–570. Springer, Heidelberg (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaneko, A., Kano, M. (2005). A Balanced Interval of Two Sets of Points on a Line. In: Akiyama, J., Baskoro, E.T., Kano, M. (eds) Combinatorial Geometry and Graph Theory. IJCCGGT 2003. Lecture Notes in Computer Science, vol 3330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30540-8_12
Download citation
DOI: https://doi.org/10.1007/978-3-540-30540-8_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24401-1
Online ISBN: 978-3-540-30540-8
eBook Packages: Computer ScienceComputer Science (R0)