Polygonal billiards with small obstacles

From MaRDI portal





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.











This page was built for publication: Polygonal billiards with small obstacles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1284779)