Blocking Visibility for Points in General Position

  • Authors:

  • Jiří Matoušek

  • Affiliations:

  • Charles Univ., Dept. of Appl. Math. and Institute of Theoretical Computer Science (ITI), Malostranské nám. 25, 118 00, Praha 1, Czech Republic and ETH Zurich, Institute of Theoretica ...

  • Venue:
  • Discrete & Computational Geometry - Special Issue Dedicated to the Memory of Victor Klee
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

For a finite set P in the plane, let b(P) be the smallest possible size of a set Q, Q∩P=∅, such that every segment with both endpoints in P contains at least one point of Q. We raise the problem of estimating b(n), the minimum of b(P) over all n-point sets P with no three points collinear. We review results providing bounds on b(n) and mention some additional observations.