Related papers: On the perimeters of simple polygons contained in …
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…
Given a natural number $n\geq3$ and two points $a$ and $b$ in the unit disk $\mathbb D$ in the complex plane, it is known that there exists a unique elliptical disk having $a$ and $b$ as foci that can also be realized as the intersection of…
Let L be a simple Euclidean arrangement of n pseudolines. It is shown that if L has exactly one (>=5)=gon P, and k is the number of edges of P that are adjacent to an unbounded cell of the subarrangement of L induced by the pseudolines in…
Motivated by biological questions, we study configurations of equal-sized disks in the Euclidean plane that neither pack nor cover. Measuring the quality by the probability that a random point lies in exactly one disk, we show that the…
A small polygon is a polygon of unit diameter. The maximal perimeter and the maximal width of a convex small polygon with $n=2^s$ vertices are not known when $s \ge 4$. In this paper, we construct a family of convex small $n$-gons, $n=2^s$…
We show that a topologically minimal disk in a tetrahedron with index $n$ is either a normal triangle, a normal quadrilateral, or a normal helicoid with boundary length 4(n+1). This mirrors geometric results of Colding and Minicozzi.
We prove that, among the polygons in a punctured disc with fixed angles, the perimeter is minimized by the polygon with an inscribed horocycle centered at the puncture. We generalize this to a disc with a cone point and to an annulus with a…
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…
A small polygon is a polygon that has diameter one. The maximal perimeter of a convex equilateral small polygon with $n=2^s$ sides is not known when $s \ge 4$. In this paper, we construct a family of convex equilateral small $n$-gons,…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m\ge 7$. Finding the largest small $n$-gon for a given number $n\ge 3$ can be formulated as a nonconvex quadratically…
In 1959, Erd\H{o}s and Moser asked for the maximum number of unit distances that may be formed among the vertices of a convex $n$-gon; until now, the best known upper bound has been $2\pi n \log_2 n + O(n)$, achieved by F\"uredi in 1990. In…
A spherical n-gon is a bordered surface homeomorphic to a closed disk, with n distinguished boundary points called corners, equipped with a Riemannian metric of constant curvature 1, except at the corners, and such that the boundary arcs…
A small polygon is a polygon of unit diameter. The maximal area of a small polygon with $n=2m$ vertices is not known when $m \ge 7$. In this paper, we construct, for each $n=2m$ and $m\ge 3$, a small $n$-gon whose area is the maximal value…
Given N points in the plane $P_1 P_2...P_N$ and a location $\Omega$, the union of discs with diameters $[\Omega P_i], i = 1, 2,...N$ covers the convex hull of the points. The location $\Omega_s$ minimizing the area covered by the union of…
We study the packing of a large number of congruent and non--overlapping circles inside a regular polygon. We have devised efficient algorithms that allow one to generate configurations of $N$ densely packed circles inside a regular polygon…
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…
Take a circle and mark $n\in\mathbb{N}$ points on it designated as vertices. For any arc segment between two consecutive vertices which does not pass through any other vertex, there is a disk centered at its midpoint and has its end points…
Erdos, Herzog and Piranian asked whether, for $n$ points in the plane with fixed diameter (maximum distance between points), an arrangement of a regular $n$-gon maximizes their product of all pairs of distances. Recently, it was discovered…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…
The main goal of this paper is to address the following problem: given a positive integer $n$, find the largest value $S(n)$ such that a square of edge length $S(n)$ in the Euclidean plane can be covered by $n$ unit squares. We investigate…