Abstract
Given a set B of n black points in general position, we say that a set of white points W blocks B if in the Delaunay triangulation of B∪W there is no edge connecting two black points. We give the following bounds for the size of the smallest set W blocking B: (i) 3n/2 white points are always sufficient to block a set of n black points, (ii) if B is in convex position, 5n/4 white points are always sufficient to block it, and (iii) at least n−1 white points are always necessary to block a set of n black points.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
