Related papers: Several problems on reduced spherical polygons of …

Let $n$ be a positive integer, not a power of two. A \textit{Reinhardt polygon} is a convex $n$-gon that is optimal in three different geometric optimization problems: it has maximal perimeter relative to its diameter, maximal width…

For sufficiently large $n$, we show that in every configuration of $n$ points chosen inside the unit square there exists a triangle of area less than $n^{-8/7-1/2000}$. This improves upon a result of Koml\'os, Pintz and Szemer\'edi from…

In this article, we prove that there exists a unique perimeter minimizer among all piecewise smooth simple closed curves in $M_{\kappa}^2$ enclosing area $A > 0$ $(A \leq 2{\pi}$ if ${\kappa} = 1)$, and it is a circle in $M_{\kappa}^2$ of…

We prove that the regular octahedron has the minimal surface area among 3-polytopes of given volume and having at most six vertices.

In [1], the author considered the problem of the optimal approximation of symmetric surfaces by biquadratic B\'ezier patches. Unfortunately, the results therein are incorrect, which is shown in this paper by considering the optimal…

We prove that every unit area convex pentagon is contained in a convex quadrilateral of area no greater than $3/\sqrt{5}$, and that every unit area convex hexagon is contained in a convex pentagon of area no greater than $7/6$. Both results…

Quantitative estimates related to the classical Borsuk problem of splitting set in Euclidean space into subsets of smaller diameter are considered. For a given $k$ there is a minimal diameter of subsets at which there exists a covering with…

We consider the smallest-area universal covering of planar objects of perimeter 2 (or equivalently closed curves of length 2) allowing translation and discrete rotations. In particular, we show that the solution is an equilateral triangle…

Inspired by a recent work of Grove-Petersen in [GP18], where the authors studied Alexandrov spaces with largest possible boundary. We study Alexandrov spaces with lower curvature bound 1 and with small boundary. When the radius of X is…

We study the problem of computing the minimum area triangle that circumscribes a given $n$-sided convex polygon touching edge-to-edge. In other words, we compute the minimum area triangle that is the intersection of 3 half-planes out of $n$…

Let $G$ be a usc decomposition of $S^n$, $H_G$ denote the set of nondegenerate elements and $\pi$ be the natural projection of $S^n$ onto $S^n/G$. Suppose that each point in the decomposition space has arbitrarily small neighborhoods with…

We present a method to obtain upper bounds on covering numbers. As applications of this method, we reprove and generalize results of Rogers on economically covering Euclidean $n$-space with translates of a convex body, or more generally,…

A convex polygon $Q$ is inscribed in a convex polygon $P$ if every side of $P$ contains at least one vertex of $Q$. We present algorithms for finding a minimum area and a minimum perimeter convex polygon inscribed in any given convex…

We apply polynomial techniques (linear programming) to obtain lower and upper bounds on the covering radius of spherical designs as function of their dimension, strength, and cardinality. In terms of inner products we improve the lower…

This paper studies the geodesic diameter of polygonal domains having h holes and n corners. For simple polygons (i.e., h = 0), the geodesic diameter is determined by a pair of corners of a given polygon and can be computed in linear time,…

Geometrical objects with integral sides have attracted mathematicians for ages. For example, the problem to prove or to disprove the existence of a perfect box, that is, a rectangular parallelepiped with all edges, face diagonals and space…

A covering problem posed by Henri Lebesgue in 1914 seeks to find the convex shape of smallest area that contains a subset congruent to any point set of unit diameter in the Euclidean plane. Methods used previously to construct such a…

We present a survey article about the geometry of convex bodies on the $d$-dimensional sphere $S^d$. We concentrate on the results based on the notion of the width of a convex body $C \subset S^d$ determined by a supporting hemisphere of…

We study the problem of partitioning a polygon into the minimum number of subpolygons using cuts in predetermined directions such that each resulting subpolygon satisfies a given width constraint. A polygon satisfies the unit-width…

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…