Abstract
Let P be a finite set of points in general position in the plane. Let C(P) be the convex hull of P and let CiP be the ith convex layer of P. A minimal convex set S of P is a convex subset of P such that every convex set of P ∩ C(S) different from S has cardinality strictly less than |S|. Our main theorem states that P contains an empty convex hexagon if C1P is minimal and C4P is not empty. Combined with the Erdos-Szekeres theorem, this result implies that every set P with sufficiently many points contains an empty convex hexagon, giving an affirmative answer to a question posed by Erdos in 1977.
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Nicolas, C. The Empty Hexagon Theorem. Discrete Comput Geom 38, 389–397 (2007). https://doi.org/10.1007/s00454-007-1343-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-007-1343-6