Skip to main content
SpringerLink
Log in

Constructions from empty polygons

  • Published:
Periodica Mathematica Hungarica Aims and scope Submit manuscript

Abstract

Let P denote a finite set of points, in general position in the plane. In this note we study conditions which guarantee that P contains the vertex set of a convex polygon that has exactly k points of P in its interior.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. D. Avis, K. Hosono and M. Urabe, On the existence of a point subset with a specified number of interior points, Selected papers in honor of Helge Tverberg, Discrete Math. 241 (2001), 33–40.

    Google Scholar 

  2. I. BÁrÁny and Gy. KÁrolyi, Problems and results around the Erdős-Szekeres convex polygon theorem, in: Discrete and computational geometry, Japanese conference, JCDCG 2000 (ed. by J. Akiyama, M. Kano and M. Urabe), Lecture Notes in Computer Science, Vol. 2098, Springer, 2001, 91–105.

  3. P. Erdős and G. Szekeres, A combinatorial problem in geometry, Compositio Math. 2 (1935), 463–470.

    Google Scholar 

  4. J. Horton Sets with no empty 7-gons, Canadian Math. Bull. 26 (1983), 482–484.

    Google Scholar 

  5. K. hosono, Gy. KÁrolyi and M. Urabe, On the existence of a convex polygon with a specified number of interior points, in: Discrete geometry, In honor of W. Kuperberg’s 60 th birthday (ed. by A. Bezdek), Marcel Dekker, 2003, 351–358.

  6. Gy. KÁrolyi, J. Pach and G. TÓth, A modular version of the Erdős-Szekeres theorem, Studia Sci. Math. Hungar. 38 (2001), 245–259.

    Google Scholar 

  7. G. Kun and G. Lippner, Large empty convex polygons in k-convex sets, Periodica Math. Hungar. 46 (2003), 81–88.

    Google Scholar 

  8. H. NyklovÁ, Almost empty polygons, Studia Sci. Math. Hungar. 40 (2003), 269–286.

    Google Scholar 

  9. P. Valtr, A sufficient condition for the existence of large empty convex polygons, Discrete Comput. Geom. 28 (2002), 671–682.

    Google Scholar 

  10. P. Valtr, Open caps and cups in planar point sets, submitted to Discrete Comput. Geom., 2003.

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Calgary Calgary, Alta. T2N 1N4, Canada

    Tibor Bisztriczky

  2. Department of Mathematics, Tokai University, 3-20-1 Orido, Shimizu, Shizuoka, 424-8610, Japan

    Kiyoshi Hosono & Masatsugu Urabe

  3. Department of Algebra and Number Theory, Eötvös Loránd University Pázmány P. sétány 1/C, H-1117, Budapest, Hungary

    Gyula Károlyi

Authors
  1. Tibor Bisztriczky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kiyoshi Hosono
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Gyula Károlyi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Masatsugu Urabe
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bisztriczky, T., Hosono, K., Károlyi, G. et al. Constructions from empty polygons. Period Math Hung 49, 1–8 (2004). https://doi.org/10.1007/s10998-004-0518-7

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10998-004-0518-7

Search

Navigation