Related papers: Minimal Perimeter Triangle in Nonconvex Quadrangle…

The renowned Fagnano problem asks for the inscribed triangle of minimal perimeter within a given reference triangle. Equivalently, it seeks a billiard trajectory inside the triangle that closes after three reflections. In this note, we…

We investigate a combinatorial optimization problem that involves patrolling the edges of an acute triangle using a unit-speed agent. The goal is to minimize the maximum (1-gap) idle time of any edge, which is defined as the time gap…

The smallest enclosing circle problem asks for the circle of smallest radius enclosing a given set of finite points on the plane. This problem was introduced in the 19th century by Sylvester [17]. After more than a century, the problem…

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$…

What is the minimum perimeter of a convex lattice $n$-gon? This question was answered by Jarnik in 1926. We solve the same question in the case when perimeter is measured by a (not necessarily symmetric) norm.

The Heilbronn triangle problem asks for the placement of $n$ points in a unit square that maximizes the smallest area of a triangle formed by any three of those points. In $1972$, Schmidt considered a natural generalization of this problem.…

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.…

The study of extremal problems on triangle areas was initiated in a series of papers by Erd\H{o}s and Purdy in the early 1970s. In this paper we present new results on such problems, concerning the number of triangles of the same area that…

The problem considered first by I. Newton (1687) consists in finding a surface of the minimal frontal resistance in a parallel flow of non-interacting point particles. The standard formulation assumes that the surface is convex with a given…

A congruum was first defined by Leonardo Pisano in 1225 and it is defined as the common difference in an arithmetic progression of three perfect squares. Later that year in his book Liber Quadratorum, Pisano proved that congruums can never…

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 consider the problem of minimising the number of edges that are contained in triangles, among $n$-vertex graphs with a given number of edges. We prove a conjecture of F\"uredi and Maleki that gives an exact formula for this minimum, for…

In this work we study the fencing problem consisting of finnding a trisection of a 3-rotationally symmetric planar convex body which minimizes the maximum relative diameter. We prove that an optimal solution is given by the so-called…

Newton's problem of minimal resistance is one of the first problems of optimal control: it was proposed, and its solution given, by Isaac Newton in his masterful Principia Mathematica, in 1686. The problem consists of determining, in…

The first nonzero eigenvalue of the Neumann Laplacian is shown to be minimal for the degenerate acute isosceles triangle, among all triangles of given diameter. Hence an optimal Poincar\'{e} inequality for triangles is derived. The proof…

Given a set S of n points in the plane and a fixed angle 0 < omega < pi, we show how to find in O(n log n) time all triangles of minimum area with one angle omega that enclose S. We prove that in general, the solution cannot be written…

In the early 17th century, Pierre de Fermat proposed the following problem: given three points in the plane, find a point such that the sum of its Euclidean distances to the three given points is minimal. This problem was solved by…

In 1964 A. Bruckner observed that any bounded open set in the plane has an inscribed triangle, that is a triangle contained in the open set and with the vertices lying on the boundary. We prove that this triangle can be taken uniformly fat,…

We study the Heilbronn triangle problem, which involves placing n points in the unit square such that the minimum area of any triangle formed by these points is maximized. A straightforward maximin formulation of this problem is highly…

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…