Minimum blocking sets of circles for a set of lines in the plane
Natas̃a Jovanović, Jan Korst, Augustus J. E. M. Janssen · TU/e Research Portal · 2008
A circle C is occluded by a set of circles C1; : : : ;Cn if every line that intersects C also intersects at least one of the Ci; i = 1; : : : ; n. In this paper, we focus on determining the minimum number of circles that occlude a given circle assuming that all circles have radius 1 and their mutual distance is at least d. As main contribution of this paper, we present upper and lower bounds on this minimal number of circles for 2 =d =4, as well as the algorithms we used to derive them.