Related papers: A Geometric proof for the Polygonal Isoperimetric …
It is a classical fact in Euclidean geometry that the regular polygon maximizes area amongst polygons of the same perimeter and number of sides, and the analogue of this in non-Euclidean geometries has long been a folklore result. In this…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
The discrete isoperimetric inequality states that among all n -gons with a fixed area, the regular n -gon has the least perimeter. We prove analogues of the discrete isoperimetric inequality (involving circumradius or inradius) for cyclic…
In this pedagogical note we present a short proof of the following main result of arxiv.org/abs/0911.5319, and clarify its relation to the isoperimetric problem. On the hyperbolic plane consider triangles ABC with fixed lengths of AB and…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
The hexagon is the least-perimeter tile in the Euclidean plane for any given area. On hyperbolic surfaces, this "isoperimetric" problem differs for every given area, as solutions do not scale. Cox conjectured that a regular $k$-gonal tile…
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…
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…
We verify an old conjecture of G. Polya and G. Szego saying that the regular n-gon minimizes the logarithmic capacity among all n-gons with a fixed area.
We give a new proof of the isoperimetric inequality in the plane, based on Steiner's formula for the area of a convex neighborhood. This proof establishes the isoperimetric inequality directly, without requiring that we separately establish…
The discrete isoperimetric inequality in Euclidean geometry states that among all $n$-gons having a fixed perimeter $p$, the one with the largest area is the regular $n$-gon. The statement is true in spherical geometry and hyperbolic…
This paper considers affine analogues of the isoperimetric inequality in the sense of piecewise linear topology. Given a closed polygon P embedded in R^d having n edges, we give upper and lower bounds for the minimal number of triangles…
P\'al's isominwidth theorem states that for a fixed minimal width, the regular triangle has minimal area. A spherical version of this theorem was proven by Bezdek and Blekherman, if the minimal width is at most $\tfrac \pi 2$. If the width…
It is well known that among all closed bounded curves in the plane with the given perimeter, the circle encloses the maximum area. There are many proofs in the literature. In this article we have given a new proof using some ideas of Demar.
The objective here is to find the maximum polygon, in area, which can be enclosed in a given triangle, for the polygons: parallelograms, rectangles and squares. It will initially be assumed that the choices are inscribed polygons, that is…
We prove optimal regularity and a detailed analysis of the free boundary of the solutions to the thin obstacle problem for nonparametric minimal surfaces with flat obstacles.
Two natural foliations, guided by area and perimeter, of the configurations spaces of planar polygons are considered and the topology of their leaves is investigated in some detail. In particular, the homology groups and the homotopy type…
The convex shape contained in a disk having prescribed area and maximal perimeter is completely characterized in terms of the area fraction. The solution is always a polygon having all but one sides equal. The lengths of the sides are…
We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…
We give a new proof of the formula expressing the area of the triangle whose vertices are the projections of an arbitrary point in the plane onto the sides of a given triangle, in terms of the geometry of the given triangle and the location…