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\cup 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.

中文翻译：

---

阻塞 Delaunay 三角剖分。

给定一组乙的ñ一般位置的黑点，我们说一套白点w ^块乙，如果在的Delaunay三角$乙\cup 宽$没有连接两个黑点的边。我们为最小集合W阻塞B的大小给出以下界限：（i）$3n/2$白点总是足以阻挡一组n 个黑点，(ii) 如果B处于凸位置，$5n/4$ 白点总是足以阻止它，并且（iii）至少 $n-1$白点总是需要阻止一组n 个黑点。