Related papers: The missing (A, D, r) diagram
Chv\'{a}tal and Klincsek (1980) gave an $O(n^3)$-time algorithm for the problem of finding a maximum-cardinality convex subset of an arbitrary given set $P$ of $n$ points in the plane. This paper examines a generalization of the problem,…
The isodiametric inequality states that the Euclidean ball maximizes the volume among all convex bodies of a given diameter. We are motivated by a conjecture of Makai Jr.~on the reverse question: Every convex body has a linear image whose…
We aim to study the classical Rosenthal-Szasz inequality for a plane whose geometry is given by a norm. This inequality states that the bodies of constant width have the largest perimeter among all planar convex bodies of given diameter. In…
The convex dimension of a $k$-uniform hypergraph is the smallest dimension $d$ for which there is an injective mapping of its vertices into $\mathbb{R}^d$ such that the set of $k$-barycenters of all hyperedges is in convex position. We…
It is shown that every not-necessarily symmetric convex body $K$ in ${\mathbb R}^n$ has an affine image $\tilde{K}$ of $K$ such that the covering numbers of $\tilde{K}$ by growing dilates of the unit Euclidean ball, as well as those of the…
In this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a…
This article introduces a representation of dynamic meshes, adapted to some numerical simulations that require controlling the volume of objects with free boundaries, such as incompressible fluid simulation, some astrophysical simulations…
We prove a sharp upper bound on convex domains, in terms of the diameter alone, of the best constant in a class of weighted Poincar\'e inequalities. The key point is the study of an optimal weighted Wirtinger inequality.
We study the problem of minimizing the second Dirichlet eigenvalue for the Laplacian operator among sets of given perimeter. In two dimensions, we prove that the optimum exists, is convex, regular, and its boundary contains exactly two…
For a two-dimensional convex body, the Kovner-Besicovitch measure of symmetry is defined as the volume ratio of the largest centrally symmetric body contained inside the body to the original body. A classical result states that 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…
A variant of the flatness problem from integer programming is studied, in which one considers convex bodies in $\mathbb{R}^d$ with at most $k$ interior lattice points. The maximum lattice width of such a body is denoted by Flt(d,k) and it…
Convex optimization is a well-established research area with applications in almost all fields. Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a…
We study computational and statistical consequences of problem geometry in stochastic and online optimization. By focusing on constraint set and gradient geometry, we characterize the problem families for which stochastic- and…
An eigenvalue problem arising in optimal insulation related to the minimization of the heat decay rate of an insulated body is adapted to enforce a positive lower bound imposed on the distribution of insulating material. We prove the…
We discuss the notions of circumradius, inradius, diameter, and minimum width in generalized Minkowski spaces (that is, with respect to gauges), i.e., we measure the "size" of a given convex set in a finite-dimensional real vector space…
Finding nonoverlapping balls with given centers in any metric space, maximizing the sum of radii of the balls, can be expressed as a linear program. Its dual linear program expresses the problem of finding a minimum-weight set of cycles…
We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…
Many years ago John Tyrell a lecturer at King's college London challenged his Ph.D. students with the following puzzle: show that there is a unique triangle of minimal perimeter with exactly one vertex to lie on one of three given lines,…
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…