Polygonal billiards with small obstacles
The authors show that in a wide class of polygons it is possible to block all paths between two points by placing a finite number of obstacles into the polygon. They show that the obtained results can be generalized from point obstacles to a small \(\varepsilon\)-neighborhood of points. Moreover, they give several conjectures.
scientific article; zbMATH DE number 1279304