On empty pentagons and hexagons in planar point sets

2011/11/24 by Pavel Valtr, Valtr, Pavel
Computer Science · Mathematics · #Combinatorics (math.CO) #Computational Geometry (cs.CG) #FOS: Computer and information sciences #FOS: Mathematics #cs.CG #math.CO

paper · pdf · doi:10.48550/arxiv.1111.5656

arxiv created 2011/11/24 · arxiv updated 2011/11/28

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.

Related

• On k-Gons and k-Holes in Point Sets
• Pentagon Minimization without Computation
• Happy Ending: An Empty Hexagon in Every Set of 30 Points
• Compatible 4-Holes in Point Sets
• Two Disjoint 5-Holes in Point Sets