On empty pentagons and hexagons in planar point sets

Abstrakt

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

Klíčová slova

• Empty polygon
• planar point set
• empty hexagon
• empty pentagon