Related papers: A Geometric Solution to the Isoperimetric Problem …
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The use of optimality conditions for constrained problems and basic ideas in triangle geometry show that polygons with prescribed area…
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…
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 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…
In this paper, we consider the problem of partitioning a polygon into a set of connected disjoint sub-polygons, each of which covers an area of a specific size. The work is motivated by terrain covering applications in robotics, where the…
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…
We study the problem of aggregating polygons by covering them with disjoint representative regions, thereby inducing a clustering of the polygons. Our objective is to minimize a weighted sum of the total area and the total perimeter of the…
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…
Many classical geometric inequalities on functionals of convex bodies depend on the dimension of the ambient space. We show that this dimension dependence may often be replaced (totally or partially) by different symmetry measures of the…
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…
We consider the following geometric optimization problem: find a maximum-area rectangle and a maximum-perimeter rectangle contained in a given convex polygon with $n$ vertices. We give exact algorithms that solve these problems in time…
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…
This paper deals with the famous isoperimetric inequality. In a first part, we give some new functional form of the isoperimetric inequality, and in a second part, we give a quantitative form with a remainder term involving Wasserstein…
The optimal circle coverage problem aims to find a configuration of circles that maximizes the covered area within a given region. Although theoretical optimal solutions exist for simple cases, the problem's NP-hard characteristic makes the…
We consider the problem of minimizing the relative perimeter under a volume constraint in an unbounded convex body $C\subset \mathbb{R}^{n+1}$, without assuming any further regularity on the boundary of $C$. Motivated by an example of an…
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…
In the present manuscript we address and solve for the first time a nonlocal discrete isoperimetric problem. We consider indeed a generalization of the classical perimeter, what we call a nonlocal bi-axial discrete perimeter, where, not…
The problem of packing equal circles in a circle is a classic and famous packing problem, which is well-studied in academia and has a variety of applications in industry. This problem is computationally challenging, and researchers mainly…
In this paper we investigate the reverse isoperimetric inequality with respect to the Gaussian measure for convex sets in $\mathbb{R}^{2}$. While the isoperimetric problem for the Gaussian measure is well understood, many relevant aspects…
We develop techniques for solving the relative isoperimetric problem on polygonal domains in $\mathbb{R}^2$, with special attention paid to corners. As an application, we solve the relative isoperimetric problem for a square with a square…