Abstract
We extend a result due to Bárányet al. and prove the following theorem: given any setS ofn points in the plane, there are pointsx andy inS, such that every circle that containsx andy contains at least [5/84(n − 2)] other points ofS.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
V. Neumann-Lara and J. Urrutia, A combinatorial result on points and circles in the plane, Technical Report TR-85-15, University of Ottawa, November 1985.
R. Hayward, D. Rappaport, and R. Wenger, Some extremal results on circles containing points,Discrete Comput. Geom., this issue, pp. 253–258.
I. Bárány, J. H. Schmerl, S. J. Sidney, and J. Urrutia, A combinatorial result about points and balls in Euclidean space,Discrete Comput. Geom., this issue, pp. 259–262.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hayward, R. A note on the circle containment problem. Discrete Comput Geom 4, 263–264 (1989). https://doi.org/10.1007/BF02187728
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF02187728