Consider the Poincare disc model for hyperbolic geometry. In this paper, a convenient computational formula is developed along with an aesthetic geometric interpretation. Two proofs, one geometric and one analytical, of each result are given.
This second part on polygons in the hyperbolic plane is based on the first part which deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The topic here is the maximum question for the area of these polygons. It is shown that the maximal copies must be cocyclic and oriented-convex or have a special collinear shape. The maximal copies are unique up to rigid hyperbolic motions. The cocyclicity means that the vertices are situated on a distance circle, a distance line or a horocycle, the three types of cycles in the hyperbolic plane. The phenomenon of different c…
There are many four vertex type theorems appearing in the literature, coming in both smooth and discrete flavors. The most familiar of these is the classical theorem in differential geometry, which states that the curvature function of a simple smooth closed curve in the plane has at least four extreme values. This theorem admits a natural discretization to Euclidean polygons due to O. Musin. In this article we adapt the techniques of Musin and prove a discrete four vertex theorem for convex hyperbolic polygons.
The hexagon is the least-perimeter tile in the Euclidean plane. On hyperbolic surfaces, the isoperimetric problem differs for every given area. Cox conjectured that a regular $k$-gonal tile with 120-degree angles is isoperimetric for its area. We prove his conjecture and more.
After work of W. P. Thurston, C. Bavard and É. Ghys constructed particular hyperbolic polyhedra from spaces of deformations of Euclidean polygons. We present this construction as a straightforward consequence of the theory of mixed-volumes. The gluing of these polyhedra can be isometrically embedded into complex hyperbolic cone-manifolds constructed by Thurston from spaces of deformations of Euclidean polyhedra. It is then possible to deduce the metric structure of the spaces of polygons embedded in complex hyperbolic orbifolds discovered by P. Deligne and G. D. Mostow.
We prove that every rational angled hyperbolic triangle has transcendental side lengths and that every rational angled hyperbolic quadrilateral has at least one transcendental side length. Thus, there does not exist a rational angled hyperbolic triangle or quadrilateral with algebraic side lengths. We conjecture that there does not exist a rational angled hyperbolic polygon with algebraic side lengths.
Certain topics on polygons are extended from Euclidean to hyperbolic geometry. This first part deals with uniqueness and existence of cocyclic polygons with prescribed sidelengths. The non-Euclidean versions are more difficult due to the existence of three different types of circles in the hyperbolic plane. The second part will be concerned with the problem of maximizing the area of polygons with fixed sidelengths. By the metric character of these problems it is necessary to dispense to a certain extent with classical hyperbolic trigonometry because angles must be replaced by length quantities…
A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are parametrized by the subspaces of $(0,\infty)^n$ that contain their side length collections, and area and circumcircle or "collar" radius determine symmetric, smooth functions on these spaces. We give formulas for and bounds on the derivatives of these functions, and make some observations on their behavior. Notably, the monotonicity properties of area and circumcircle …
Formulas about the side lengths, diagonal lengths or radius of the circumcircle of a cyclic polygon in Euclidean geometry, hyperbolic geometry or spherical geometry can be unified.
T. Keleti asked, whether the ratio of the perimeter and the area of a finite union of unit squares is always at most 4. In this paper we present an example where the ratio is greater than 4. We also answer the analogous question for regular triangles negatively and list a number of open problems.
Heron's formula states that the area $K$ of a triangle with sides $a$, $b$, and $c$ is given by $$ K=\sqrt {s(s-a) (s-b) (s-c)} $$ where $s$ is the semiperimeter $(a+b+c)/2$. Brahmagupta, Robbins, Roskies, and Maley generalized this formula for polygons of up to eight sides inscribed in a circle. In this paper we derive formulas giving the areas of any $n$-gon, with odd $n$, in terms of the ordered list of side lengths, if the $n$-gon is circumscribed about a circle (instead of being inscribed in a circle). Unlike the cyclic polygon problem, where the order of the sides does not matter, for th…
It is known that cyclic configurations of a planar polygonal linkage are critical points of the signed area function. In the paper, we announce an explicit formula of the Morse index for the signed area of a cyclic configuration. It depends not only on the combinatorics of a cyclic configuration, but also includes some metric characterization.
We consider a hyperbolic polygon in the unit disk $\{z:\, |z|<1\}$ with all its vertices on the unit circle $\{z:\, |z|=1\}$ and a growth process of such polygons when each $n$-gon generates an $n(n-1)$-gon by inverting itself across all of its sides. In this paper, we prove some general monotonicity results of inversion for convex hyperbolic $n$-gons and solve an extremal problem that, among all convex hyperbolic $4$-gons containing the origin, the inverted side length of the longest side of the given hyperbolic $4$-gon is minimal for the regular hyperbolic $4$-gon.
This chapter is motivated by the paper by Thurston on triangulations of the sphere and singular flat metrics on the sphere. Thurston locally parametrized the moduli space of singular flat metrics on the sphere with prescribed positive curvature data by the complex hyperbolic space of appropriate dimension. This work can be considered as a generalization of signature calculation of the Hermitian form that he made in his paper. The moduli space of singular flat metrics having unit area on the sphere with prescribed curvature data can be locally parametrized by certain spaces of polygons. This ca…
We confirm two conjectures of Lassak on the area of reduced spherical polygons. The area of every reduced spherical non-regular $n$-gon is less than that of the regular spherical $n$-gon of the same thickness. Moreover, the area of every reduced spherical polygon is less than that of the regular spherical odd-gons of the same thickness and whose number of vertices tends to infinity.
We investigate the ``generalized Heron polynomial'' that relates the squared area of an n-gon inscribed in a circle to the squares of its side lengths. For a (2m+1)-gon or (2m+2)-gon, we express it as the defining polynomial of a certain variety derived from the variety of binary (2m-1)-forms having m-1 double roots. Thus we obtain explicit formulas for the areas of cyclic heptagons and octagons, and illuminate some mysterious features of Robbins' formulas for the areas of cyclic pentagons and hexagons. We also introduce a companion family of polynomials that relate the squared area of an n-go…
This paper presents a general method for obtaining radius of the corresponding circumference to a cyclical polygon $n$ sides given the lengths of said sides, using the notion of complex number. As of radius $r$, obtained, can then be calculated polygon area in question applying known expressions which requires, after $n=4$, a powerful calculation tool. Are also given like elements regarding non convex polygons cyclic, although in this respect it deepens less and is not considered, course, the calculation of areas.
Two ideal polygons, $(p_1,\ldots,p_n)$ and $(q_1,\ldots,q_n)$, in the hyperbolic plane or in hyperbolic space are said to be $α$-related if the cross-ratio $[p_i,p_{i+1},q_i,q_{i+1}] = α$ for all $i$ (the vertices lie on the projective line, real or complex, respectively). For example, if $α= -1$, the respective sides of the two polygons are orthogonal. This relation extends to twisted ideal polygons, that is, polygons with monodromy, and it descends to the moduli space of Möbius-equivalent polygons. We prove that this relation, which is, generically, a 2-2 map, is completely integrable in the…
In his works [R1,R2] David Robbins proposed several interrelated conjectures on the area of the polygons inscribed in a circle as an algebraic function of its sides. Most recently, these conjectures have been established in the course of several independent investigations. In this note we give an informal outline of these developments.
A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small $n$-gon for this case. The improvement affects the $1/n^3$ term of an asymptotic expansion; prior advances affected less significant terms. This bound cannot be improved by more than $O(1/n^3)$. For $n=6$, $8$, $10$, and $12$, the polygon we construct has maximal area.
Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, Löffler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here we give an algorithm with linear time complexity.
We study the locus of the Circumcenter of Mass of Poncelet polygons, and the limit of the Center of Mass (when we consider the polygon as a "homogeneous lamina") for degenerate Poncelet polygons. We also provide a proof for one of Dan Reznik invariants for billiard trajectories. Plus, we take a look at how the scene looks like when we shift to spherical geometry.
We say that a polygon inscribed in the circle is asymmetric if it contains no two antipodal points being the endpoints of a diameter. Given $n$ diameters of a circle and a positive integer $k<n$, this paper addresses the problem of computing a maximum area asymmetric $k$-gon having as vertices $k<n$ endpoints of the given diameters. The study of this type of polygons is motivated by ethnomusiciological applications.
Sequences of polygons generated by performing iterative processes on an initial polygon have been studied extensively. One of the most popular sequences is the one sometimes referred to as {\it Kasner polygons}. Given a polygon $K$, the first Kasner descendant $K'$ of $K$ is obtained by placing the vertices of $K'$ at the midpoints of the edges of $K$. More generally, for any fixed $m$ in $(0,1)$ one may define a sequence of polygons $\{K^{t}\}_{t\ge 0}$ where each polygon $K^{t}$ is obtained by dividing every edge of $K^{t-1}$ into the ratio $m:(1-m)$ in the counterclockwise (or clockwise) di…
We describe a hyperbolic version of the Ambartzumian-Pleijel identity. We use this identity to prove the hyperbolic Crofton formula and the hyperbolic isoperimetric inequality. This identity also provides a way to compute the chord length distribution for an ideal polygon in the hyperbolic plane. The analogous results for a maximally symmetric, simply connected, $2$-dimensional Riemannian manifold with constant sectional curvature are given at the end.
We study hyperbolic polyhedral surfaces with faces isometric to regular hyperbolic polygons satisfying that the total angles at vertices are at least $2π.$ The combinatorial information of these surfaces is shown to be identified with that of Euclidean polyhedral surfaces with negative combinatorial curvature everywhere. We prove that there is a gap between areas of non-smooth hyperbolic polyhedral surfaces and the area of smooth hyperbolic surfaces. The numerical result for the gap is obtained for hyperbolic polyhedral surfaces, homeomorphic to the double torus, whose 1-skeletons are cubic gr…
Given a convex $n$-gon $P$ and a positive integer $m$ such that $3\le m\le n-1$, let $Q$ denote the largest area convex $m$-gon contained in $P$. We are interested in the minimum value of $Δ(Q)/Δ(P)$, the ratio of the areas of these two polygons. More precisely, given positive integers $n$ and $m$, with $3 \le m \le n-1$, define \begin{equation*} f_n(m)=\min_{P\in \mathcal {P}_n} \max_{Q \subset P,|Q|=m} \frac{Δ(Q)}{Δ(P)} \end{equation*} where the maximum is taken over all $m$-gons contained in $P$, and the minimum is taken over $\mathcal{P}_n$, the entire class of convex $n$-gons. The values …
In Groeneboom (1988) a central limit theorem for the number of vertices of the convex hull of a uniform sample from the interior of convex polygon was derived. In the unpublished preprint Nagaev and Khamdamov (1991) (in Russian) a central limit result for the joint distribution of the number of vertices and the remaining area is given, using a coupling of the sample process near the border of the polygon with a Poisson point process as in Groeneboom (1988), and representing the remaining area in the Poisson approximation as a union of a doubly infinite sequence of independent standard exponent…