arXiv 1506.080692015-06math.MG

A variational principle for cyclic polygons with prescribed edge lengths

Hana Kouřimská, Lara Skuppin, Boris Springborn

备注：: 18 pages, 6 figures. v2: typos corrected, final version
发表信息：: A. I. Bobenko (editor). Advances in Discrete Differential Geometry, Springer, Berlin, 2016, pages 177-195. (Open access)
DOI：: 10.1007/978-3-662-50447-5_5

英文摘要：

We provide a new proof of the elementary geometric theorem on the existence and uniqueness of cyclic polygons with prescribed side lengths. The proof is based on a variational principle involving the central angles of the polygon as variables. The uniqueness follows from the concavity of the target function. The existence proof relies on a fundamental inequality of information theory. We also provide proofs for the corresponding theorems of spherical and hyperbolic geometry (and, as a byproduct, in $1+1$ spacetime). The spherical theorem is reduced to the euclidean one. The proof of the hyperbolic theorem treats three cases separately: Only the case of polygons inscribed in compact circles can be reduced to the euclidean theorem. For the other two cases, polygons inscribed in horocycles and hypercycles, we provide separate arguments. The hypercycle case also proves the theorem for "cyclic" polygons in $1+1$ spacetime.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Polygons with prescribed Gauss map in Hadamard spaces and Euclidean buildings

We show that given a stable weighted configuration on the asymptotic boundary of a locally compact Hadamard space, there is a polygon with Gauss map prescribed by the given weighted configuration if the configuration is stable. Moreover, the same result holds for semistable configurations on arbitrary Euclidean buildings. We also examine how rays project to closed convex subsets of Hadamard spaces.

2004-12-02math.MG

Morse index of a cyclic polygon

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.

2010-09-03math.MG

Cyclic polygons in classical geometry

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.

2010-09-15math.MG

General method of Complex Polynomial for determining the radius of the circle circumscribed to a cyclic polygon an arbitrary number of sides, and some important consequences

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.

2015-12-19math.MG

Polygons with prescribed edge slopes: configuration space and extremal points of perimeter

We describe the configuration space $\mathbf{S}$ of polygons with prescribed edge slopes, and study the perimeter $\mathcal{P}$ as a Morse function on $\mathbf{S}$. We characterize critical points of $\mathcal{P}$ (these are \textit{tangential} polygons) and compute their Morse indices. This setup is motivated by a number of results about critical points and Morse indices of the oriented area function defined on the configuration space of polygons with prescribed edge lengths (flexible polygons). As a by-product, we present an independent computation of the Morse index of the area function (ob…

2017-12-01math.GTmath.MG

On the Areas of Cyclic and Semicyclic Polygons

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…

2004-07-16math.MG

更多相关论文收起更多论文

The geometry of cyclic hyperbolic polygons

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 …

2015-06-30math.GTmath.MG

多边形等周不等式的一个几何证明

A Geometric proof for the Polygonal Isoperimetric Inequality

本文利用约束问题的最优性条件与三角形几何基本思想，从几何角度证明了在给定面积下最小化周长的多边形必定是正多边形。

2023-09-11math.MG

The area of cyclic polygons: Recent progress on Robbins' Conjectures

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.

2004-08-09math.COmath.MG

Points and lines configurations for perpendicular bisectors of convex cyclic polygons

We characterize the topological configurations of points and lines that may arise when placing n points on a circle and drawing the n perpendicular bisectors of the sides of the corresponding convex cyclic n-gon. We also provide exact and asymptotic formulas describing a random realizable configuration, obtained either by sampling the points uniformly at random on the circle or by sampling a realizable configuration uniformly at random.

2022-03-23math.COmath.MGmath.PR

A "right" path to cyclic polygons

It is well known that Heron's theorem provides an explicit formula for the area of a triangle, as a symmetric function of the lengths of its sides. It has been extended by Brahmagupta to quadrilaterals inscribed in a circle (cyclic quadrilaterals). A natural problem is trying to further generalize the result to cyclic polygons with a larger number of edges, which, surprisingly, has revealed to be far from simple. In this paper we investigate such a problem by following a new and elementary approach. We start from the simple observation that the incircle of a right triangle touches its hypothen…

2019-10-17math.COmath.HOmath.MG

Polygons in hyperbolic geometry 1: Rigidity and inversion of the n-inequality

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…

2010-08-19math.GTmath.MG

Dual-cyclic polytopes of convex planar polygons with fixed vertex angles

If we fix the angles at the vertices of a convex planar $n$-gon, the lengths of its edges must satisfy two linear constraints in order for it to close up. If we also require unit perimeter, our vectors of $n$ edge lengths form a convex polytope of dimension $n-3$, each facet of which consists of those $n$-gons in which the length of a particular edge has fallen to zero. Bavard and Ghys require unit area instead, which gives them a hyperbolic polytope. Those two polytopes are combinatorially equivalent, so either is fine for our purposes. Such a fixed-angles polytope is combinatorially richer w…

2020-02-19math.COmath.GTmath.MG

A characterization of affinely regular polygons

In 1970, Coxeter gave a short and elegant geometric proof showing that if $p_1, p_2, \ldots, p_n$ are vertices of an $n$-gon $P$ in cyclic order, then $P$ is affinely regular if, and only if there is some $λ\geq 0$ such that $p_{j+2}-p_{j-1} = λ(p_{j+1}-p_j)$ for $j=1,2,\ldots, n$. The aim of this paper is to examine the properties of polygons whose vertices $p_1,p_2,\ldots,p_n \in \mathbb{C}$ satisfy the property that $p_{j+m_1}-p_{j+m_2} = w (p_{j+k}-p_j)$ for some $w \in \mathbb{C}$ and $m_1,m_2,k \in \mathbb{Z}$. In particular, we show that in `most' cases this implies that the polygon is …

2018-01-17math.FAmath.MGmath.NT