On empty pentagons and hexagons in planar point sets

  • Authors:

  • Pavel Valtr

  • Affiliations:

  • Charles University, Malostranské nám., Czech Republic

  • Venue:
  • CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

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.