Related papers: Finite variations on the isoperimetric problem
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…
We consider the edge- and vertex-isoperimetric probem on finite and infinite hexagonal grids: For a subset W of the hexagonal grid of given cardinality, we give a lower bound for the number of edges between W and its complement, and lower…
We consider the isoperimetric problem in planar sectors with density $r^{p}$, and with density $a>1$ inside the unit disk and $1$ outside. We characterize solutions as a function of sector angle. We also solve the isoperimetric problem in…
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
We consider three generalizations of the isoperimetric problem to higher codimension and provide results on equilibrium, stability, and minimization.
We consider methods for finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of points in the plane. Both problems are known to be NP-hard; at the center of the recent CG Challenge, practical…
We study the isoperimetric problem for the radially symmetric measures. Applying the spherical symmetrization procedure and variational arguments we reduce this problem to a one-dimensional ODE of the second order. Solving numerically this…
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…
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…
The isoperimetric problem with a density or weighting seeks to enclose prescribed weighted volume with minimum weighted perimeter. According to Chambers' recent proof of the log-convex density conjecture, for many densities on…
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…
The paper is devoted to some extremal problems, related to convex polygons in the Euclidean plane and their perimeters. We present a number of results that have simple formulations, but rather intricate proofs. Related and still unsolved…
The aim of this paper is to consider the Lobachevskii geometry analog of a well-known Euclidian problem; namely: to find a triangle with two fixed sides and the maximum area
The isoperimetric problem is one of the oldest in geometry and it consists of finding a surface of minimum area that encloses a given volume $V$. It is particularly important in physics because of its strong relation with stability, and…
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…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
In this paper we consider a partial overdetermined mixed boundary value problem in domains inside a cone as in [18]. We show that in cones having an isoperimetric property the only domains which admit a solution and which minimize a…
We classify the volume preserving stable hypersurfaces in the real projective space $\mathbb{RP}^n$. As a consequence, the solutions of the isoperimetric problem are tubular neighborhoods of projective subspaces $\mathbb{RP}^k\subset…
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 study the isoperimetric problem in Euclidean space endowed with a density. We first consider piecewise constant densities and examine particular cases related to the characteristic functions of half-planes, strips and balls. We also…