The maximum size of a convex polygon in a restricted set of points in the plane
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
Assume we havek points in general position in the plane such that the ratio between the maximum distance of any pair of points to the minimum distance of any pair of points is at mostα√k, for some positive constantα. We show that there exist at leastβk 1/4 of these points which are the vertices of a convex polygon, for some positive constantβ=β(α). On the other hand, we show that for every fixedε>0, ifk>k(ε), then there is a set ofk points in the plane for which the above ratio is at most 4√k, which does not contain a convex polygon of more thank 1/3+ε vertices.
- P. Bateman and P. Erdös, Geometrical extrema suggested by a lemma of Besicovitch,Amer. Math. Monthly 58 (1951), 306–314; reprinted in , 667–675.
- P. Erdös,The Art of Counting, MIT Press, Cambridge, MA, 1973.
- P. Erdös and G. Szekeres, A combinatorial problem in geometry,Compositio Math. 2 (1935), 463–470; reprinted in , 5–12.
- P. Erdös and G. Szekeres, On some extremum problems in elementary geometry,Ann. Univ. Sci. Budapest 3/4 (1960/61), 53–62; reprinted in , 680–689.
- H. Hadwiger, H. Debrunner, and V. Klee,Combinatorial Geometry in the Plane, Holt, Rinehart, Winston, New York, 1964 (English translation).
- J. D. Horton, Sets with no empty convex 7-gons,Canad. Math. Bull. 26 (1983), 482–484.
- H. Rademacher and O. Toeplitz,The Enjoyment of Mathematics, translated by H. Zuckerman, Princeton University Press, Princeton, NJ, 1957.
- The maximum size of a convex polygon in a restricted set of points in the plane
Discrete & Computational Geometry
Volume 4, Issue 1 , pp 245-251
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- Author Affiliations
- 1. Department of Mathematics, Tel Aviv University, Tel Aviv, Israel
- 2. Department of Mathematics, Technion-Israel Institute of Technology, Haifa, Israel
- 3. Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Canada