On empty convex polygons in a planar point set

Let P be a set of n points in general position in the plane. Let Xk(P ) denote the number of empty convex k-gons determined by P. We derive, using elementary proof techniques, several equalities and inequalities involving the quantities Xk(P) and several related quantities. Most of these equalities and inequalities are new, except for a few that have been proved earlier using a considerably more complex machinery from matroid and polytope theory, and algebraic topology. Some of these relationships are also extended to higher dimensions. We present several implications of these relationships, and discuss their connection with several long-standing open problems, the most notorious of which is the existence of an empty convex hexagon in any point set with sufficiently many points. © 2005 Elsevier Inc. All rights reserved.

• Type: Conference
• Year: 2004
• Where: COMPGEOM
• Authors: Rom Pinchasi, Rados Radoicic, Micha Sharir
• Keywords: COMPGEOM 2004, Elementary Proof Techniques, Empty Convex K-gons, Long-standing Open Problems