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.
Recommendations
Cited in
(15)- Birkhoff billiards are insecure
- Infinitely generated Veech groups
- On the Manhattan pinball problem
- Rotation sets of billiards with \(N\) obstacles on a torus
- Blocking light in compact Riemannian manifolds
- On the finite blocking property
- Blocking of billiard orbits and security for polygons and flat surfaces
- Obstacles with non-trivial trapping sets in higher dimensions
- Billiard dynamics: An updated survey with the emphasis on open problems
- Blocking: new examples and properties of products
- Dispersing Billiards with Small Holes
- Finite blocking property versus pure periodicity
- Billiard dynamics: a survey with the emphasis on open problems
- Rotation sets of billiards with one obstacle
- On topological entropy of billiard tables with small inner scatterers
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)