Related papers: Minimal Perimeter Triangle in Nonconvex Quadrangle…
This paper is devoted to the theoretical and numerical investigation of an augmented Lagrangian method for the solution of optimization problems with geometric constraints. Specifically, we study situations where parts of the constraints…
We refer here to the surprising construction made by Giuseppe Peano in 1890. He gave an example of a continuous function (called now the Peano curve) from the unit interval to the whole unit square. We show here the existence of a more…
In 1970, Lawson solved the topological realization problem for minimal surfaces in the sphere, showing that any closed orientable surface can be minimally embedded in $\mathbb{S}^3$. The analogous problem for surfaces with boundary was…
In 1926, Jarn\'ik introduced the problem of drawing a convex $n$-gon with vertices having integer coordinates. He constructed such a drawing in the grid $[1,c\cdot n^{3/2}]^2$ for some constant $c>0$, and showed that this grid size is…
The notion of the angle between two subspaces has a long history, dating back to Friedrichs's work in 1937 and Dixmier's work on the minimal angle in 1949. In 2006, Deutsch and Hundal studied extensions to convex sets in order to analyze…
We characterize the solution to the Newton minimal resistance problem in a class of radial q-concave profiles. We also give the corresponding result for one-dimensional profiles. Moreover, we provide a numerical optimization algorithm for…
The classical Heron problem states: \emph{on a given straight line in the plane, find a point $C$ such that the sum of the distances from $C$ to the given points $A$ and $B$ is minimal}. This problem can be solved using standard geometry or…
A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n\right)$ is such that every convex body in ${\mathbb R}^{n}$ can be covered by a union of the interiors of at most…
Constrained quasiconvex optimization problems appear in many fields, such as economics, engineering, and management science. In particular, fractional programming, which models ratio indicators such as the profit/cost ratio as fractional…
We propose a technique called Rotate-and-Kill for solving the polygon inclusion and circumscribing problems. By applying this technique, we obtain $O(n)$ time algorithms for computing (1) the maximum area triangle in a given $n$-sided…
The minimum rank problem is to determine for a graph $G$ the smallest rank of a Hermitian (or real symmetric) matrix whose off-diagonal zero-nonzero pattern is that of the adjacency matrix of $G$. Here $G$ is taken to be a circulant graph,…
In this paper we are interested in "optimal" universal geometric inequalities involving the area, diameter and inradius of convex bodies. The term "optimal" is to be understood in the following sense: we tackle the issue of…
The smallest enclosing circle problem introduced in the 19th century by J. J. Sylvester [20] aks for the circle of smallest radius enclosing a given set of finite points in the plane. An extension of the smallest enclosing circle problem…
This paper presents a geometric approach to the classical isoperimetric problem by analysing the efficiency of regular polygons in enclosing maximum area for a fixed perimeter. Using efficiency metrics, it proves that regular polygons…
We explore optimal circular nonconvex partitions of regular k-gons. The circularity of a polygon is measured by its aspect ratio: the ratio of the radii of the smallest circumscribing circle to the largest inscribed disk. An optimal…
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…
Let $A_1,A_2,...,A_n$ be the vertices of a polygon with unit perimeter, that is $\sum_{i=1}^n |A_i A_{i+1}|=1$. We derive various tight estimates on the minimum and maximum values of the sum of pairwise distances, and respectively sum of…
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…
A quadrangular embedding of a graph in a surface $\Sigma$, also known as a quadrangulation of $\Sigma$, is a cellular embedding in which every face is bounded by a $4$-cycle. A quadrangulation of $\Sigma$ is minimal if there is no…
The minimum convex cover problem seeks to cover a polygon $P$ with the fewest convex polygons that lie within $P$. This problem is $\exists\mathbb R$-complete, and the best previously known algorithm, due to Eidenbenz and Widmayer (2001),…