Abstract
A finite set of points, in general position in the plane, is almost convex if every triple determines a triangle with at most one point in its interior. For every ℓ ≥ 3, we determine the maximum size of an almost convex set that does not contain the vertex set of an empty convex ℓ-gon.
Similar content being viewed by others
References
P. Erdős, On some problems of elementary and combinatorial geometry, Ann. Mat. Pura Appl. (4), 103 (1975), 99–108.
P. Erdős and Gy. Szekeres, A combinatorial problem in geometry, Compositio Math., 2 (1935), 464–470.
T. Gerken, Empty convex hexagons in planar point sets, Discrete Comput. Geom., to appear.
H. Harborth, Konvexe Fünfecke in ebenen Punktmengen, Elem. Math., 33 (1978), 116–118.
J. D. Horton, Sets with no empty convex 7-gons, Canad. Math. Bull., 26 (1983), 482–484.
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.
G. Kun and G. Lippner, Large convex empty polygons in k-convex sets, Period. Math. Hungar., 46 (2003), 81–88.
C. M. Nicolás, The empty hexagon theorem, Discrete Comput. Geom., 38 (2007), 389–397.
P. Valtr, A sufficient condition for the existence of large empty convex polygons, Discrete Comput. Geom., 28 (2002), 671–682.
P. Valtr, Open caps and cups in planar point sets, Discrete Comput. Geom., 37 (2007), 565–576.
P. Valtr, On the empty hexagons, submitted.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Imre Bárány
Research was supported by project LN00A056 of The Ministry of Education of the Czech Republic.
Partially supported by grants T043631 and NK67867 of the Hungarian NFSR (OTKA).
Rights and permissions
About this article
Cite this article
Valtr, P., Lippner, G. & Károlyi, G. Empty convex polygons in almost convex sets. Period Math Hung 55, 121–127 (2007). https://doi.org/10.1007/s10998-007-4121-z
Received:
Accepted:
Published:
Issue date:
DOI: https://doi.org/10.1007/s10998-007-4121-z