Related papers: A Geometric proof for the Polygonal Isoperimetric …
We will first solve the following problem analytically: given a piece of wire of specified length, we will find where the wire should be cut and bent to form two regular polygons not necessarily having the same number of sides, so that the…
In this paper we will do the following: (1) show how to geometrically define multiplication, using only basic plane geometry, independently of area and any notion of similar triangles; (2) prove all the properties of multiplication using…
We obtain a sharp quantitative isoperimetric inequality for nonlocal $s$-perimeters, uniform with respect to $s$ bounded away from $0$. This allows us to address local and global minimality properties of balls with respect to the…
We prove a discrete analogue to a classical isoperimetric theorem of Weil for surfaces with non-positive curvature. It is shown that hexagons in the triangular lattice have maximal volume among all sets of a given boundary in any…
Motivated by problems arising in geometric flows, we prove several regularity results for systems of local and nonlocal equations, adapting to the parabolic case a neat argument due to Caffarelli. The geometric motivation of this work comes…
The parametric degree of a rational surface is the degree of the polynomials in the smallest possible proper parametrization. An example shows that the parametric degree is not a geometric but an arithmetic concept, in the sense that it…
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…
We prove that if $(M,g)$ is a topological 3-ball with a $C^4$-smooth Riemannian metric $g$, and mean-convex boundary $\partial M$ then knowledge of least areas circumscribed by simple closed curves $\gamma \subset \partial M$ uniquely…
It is well-known that normal extremals in sub-Riemannian geometry are curves which locally minimize the energy functional. Most proofs of this fact do not make, however, an explicit use of relations between local optimality and the geometry…
It was proved by Almgren that among boundaries whose mean curvature is bounded from above, perimeter is uniquely minimized by balls. We obtain sharp stability estimates for Almgren's isoperimetric principle and, as an application, we deduce…
We establish a family of parametric isoperimetric-type inequalities with multiple geometric quantities for closed convex curves. These inequalities hold under certain parameter conditions. We also prove the equality conditions. Some new…
Nandakumar asked whether there is a tiling of the plane by pairwise non-congruent triangles of equal area and equal perimeter. Here a weaker result is obtained: there is a tiling of the plane by pairwise non-congruent triangles of equal…
A high-level description of an algorithm which computes the minimum perimeter triangle enclosing a convex polygon in linear time exists in the literature. Besides that an implementation of the algorithm is given in the subsequent work.…
In this paper we prove some geometric inequalities for closed surfaces in Euclidean three-space. Motivated by Gage's inequality for convex curves, we first verify that for convex surfaces the Willmore energy is bounded below by some…
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…
An O(n) test for polygon convexity is stated and proved. It is also proved that the test is minimal in a certain exact sense.
A rectilinear polygon is a polygon whose edges are axis-aligned. Walking counterclockwise on the boundary of such a polygon yields a sequence of left turns and right turns. The number of left turns always equals the number of right turns…
We introduce an algorithm which can be directly used to feasible and optimum search in linear programming. Starting from an initial point the algorithm iteratively moves a point in a direction to resolve the violated constraints. At the…
Under study is the new class of geometrical extremal problems in which it is required to achieve the best result in the presence of conflicting goals; e.g., given the surface area of a convex body $\mathfrak x$, we try to maximize the…
We give an overview of theoretical and practical aspects of finding a simple polygon of minimum (Min-Area) or maximum (Max-Area) possible area for a given set of n points in the plane. Both problems are known to be NP-hard and were the…