On empty pentagons and hexagons in planar point sets

Abstract

We give improved lower bounds on the minimum number of $k$-holes (empty convex $k$-gons) in a set of $n$ points in general position in the plane, for $k=5,6$.

Cited by in corpus (1)

• A superlinear lower bound on the number of 5-holes