Abstract
This paper proves that any set of n points in the plane contains two points such that any circle through those two points encloses at least \(n\left( {1/2 - 1\sqrt {12} } \right) + O(1) \approx n/4 \cdot 7\) points of the set. The main ingredients used in the proof of this result are edge counting formulas for k-order Voronoi diagrams and a lower bound on the minimum number of semispaces of size at most k.
Similar content being viewed by others
References
Bárány, I., Schmerl, J. H., Sidney, S. J. and Urrutia, J., ‘A Combinatorial Result about Points and Balls in Euclidean Space’ Discrete Comput. Geom. 4 (1989), 259–262.
Edelsbrunner, H., Algorithms in Combinatorial Geometry, Springer-Verlag, Heidelberg, Germany, 1987.
Goodman, J. E. and Pollack, R., ‘On the Combinatorial Classification of Nondegenerate Configurations in the Plane’, J. Combin. Theory Ser. A 29 (1980), 220–235.
Hayward, R., ‘A Note on the Circle Containment Problem’ Discrete Comput. Geom. 4 (1989), 263–264.
Hayward, R., Rappaport, D. and Wenger, R., ‘Some Extremal Results on Circles Containing Points’ Discrete Comput. Geom. 4 (1989), 253–258.
Lee, D. T., ‘On k-Nearest Neighbor Voronoi Diagrams in the Plane’, IEEE Trans. Comput. C-31(1982), 478–487.
Neumann-Lara, V. and Urrutia, J., ‘A Combinatorial Result on Points and Circles in the Plane’, Discrete Math. 69 (1988), 173–178.
Shamos, M. I. and Hoey, D., ‘Closest Point Problems’, Proc. 16th Ann. IEEE Symp. Found. Comput. Sci. (1976), pp. 151–162.
Author information
Authors and Affiliations
Additional information
Work on this paper by the first author has been supported by Amoco Fnd. Fac. Dev. Comput. Sci. 1-6-44862 and by the National Science Foundation under Grant CCR-8714565, by the second author has been partially supported by the Digital Equipment Corporation, by the fourth author has been partially supported by the Office of Naval Research under Grant N00014-86K-0416.
Rights and permissions
About this article
Cite this article
Edelsbrunner, H., Hasan, N., Seidel, R. et al. Circles through two points that always enclose many points. Geom Dedicata 32, 1–12 (1989). https://doi.org/10.1007/BF00181432
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00181432