Non-Euclidean visibility problems
Visibility problems have been studied since a century. Perhaps the most celebrated problems are the visible version of Gauss' circle problem and the so-called orchard problem. In contrast with Gauss' circle problem, orchard problem can be considered as solved in a wide sense [see \textit{Allen} (1986)] by elementary methods. In this paper the author considers the analog of visibility problems in hyperbolic plane represented by Poincaré's plane \(\mathbb{H}\), i.e., the upper half plane with the metric \(ds^2= y^{-2}\,dx^2+ y^{-2}\,dy^2\), the origin \(i\in\mathbb{H}\) and replacing the standard lattice \(\mathbb{Z}\times\mathbb{Z}\) by the orbit \({\mathfrak L}\) of \(z= i\) under the full modular group \(\text{SL}_2(\mathbb{Z})\). A point \(z\in{\mathfrak L}\), \(z\neq i\) is said to be visible if the arc of geodesic connecting \(i\) and \(z\) does not contain any other point in \({\mathfrak L}\). The study of the visibility problem in the hyperbolic case differs from the Euclidean case due to the following algebraic and geometric facts: (i) In the Euclidean case the group of integral translations is Abelian whereas in hyperbolic case the underlying group \(\text{SL}_2(\mathbb{Z})\) is not Abelian. (ii) the Euclidean isoperimetric inequality, which is sharp for circles, is qualitatively different from its hyperbolic analog for large areas. In this paper, a hyperbolic criterion for visibility of points and the structure of lattice points in rays have been investigated. The visible Gauss circle problem and the orchard problem have also been studied and some numerical data are given to illustrate the results.
- Visibility and intersection problems in plane geometry
- Visibility in semi-convex spaces
- Visibility of surfaces via differential geometry
- scientific article; zbMATH DE number 4078149
- Non-Euclidean Dubins' problem
- scientific article; zbMATH DE number 5490684
- Visibility maps and spherical algorithms
- scientific article; zbMATH DE number 2087475
- On the complexity of visibility problems with moving viewpoints
- Diffraction from visible lattice points and kth power free integers
- scientific article; zbMATH DE number 3485662 (Why is no real title available?)
- On the arithmetic of phase locking: coupled neurons as a lattice on \(\mathbb{R}^{2}\)
- On the primitive circle problem
- Polya's Orchard Problem
- Primitive lattice points in rational ellipses and related arithmetic functions
- The circle problem in the hyperbolic plane
- The distribution and moments of the error term in the Dirichlet divisor problem
- Vector and scalar reachability problems in \(\operatorname{SL}(2, \mathbb{Z})\)
- Vector ambiguity and freeness problems in \(\mathrm{SL} (2,\mathbb {Z})\)
- Hyperbolic lattice point problems
- Polya's Orchard Problem
- The membership problem for subsemigroups of \(\operatorname{GL}_2(\mathbb{Z})\) is \textbf{NP}-complete
- Visibility and intersection problems in plane geometry
This page was built for publication: Non-Euclidean visibility problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q998215)
