2 research outputs found
On Visibility and Blockers
This expository paper discusses some conjectures related to visibility and
blockers for sets of points in the plane
Blocking Visibility for Points in General Position
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 observation