Abstract.
We introduce and study the notion of security for polygons and flat surfaces. Let P be one. For x, y ∈ P let G(x, y) be the set of geodesics connecting x and y. We say that P is secure if for any x, y ∈ P all geodesics in G(x, y) can be blocked by a finite set B ⊂ P. We prove, in particular, that a lattice polygon is secure iff it is arithmetic.
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding author
Additional information
Received: September 2003 Revision: March 2004 Accepted: March 2004
Rights and permissions
About this article
Cite this article
Gutkin, E. Blocking of billiard orbits and security for polygons and flat surfaces. GAFA, Geom. funct. anal. 15, 83–105 (2005). https://doi.org/10.1007/s00039-005-0502-2
Issue Date:
DOI: https://doi.org/10.1007/s00039-005-0502-2