Related papers: Finite variations on the isoperimetric problem
Inspired by a planar partitioning problem involving multiple improper chambers, this article investigates using classical techniques what can be said of the existence, uniqueness, and regularity of minimizers in a certain free-endpoint…
The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…
While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…
A coordinate-free proof of the Maximum Principle is provided in the specific case of an optimal control problem with fixed time. Our treatment heavily relies on a special notion of variation of curves that consist of a concatenation of…
This article belongs to the area of geometric tomography, which is the study of geometric properties of solids based on data about their sections and projections. We describe a new direction in geometric tomography where different…
For a complete noncompact connected Riemannian manifold with bounded geometry, we prove the existence of isoperimetric regions in a larger space obtained by adding finitely many limit manifolds at infinity. As one of many possible…
A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…
A convex polygon Q is circumscribed about a convex polygon P if every vertex of P lies on at least one side of Q. We present an algorithm for finding a maximum area convex polygon circumscribed about any given convex n-gon in O(n^3) time.…
We prove new versions of the isomorphic Busemann-Petty problem for two different measures and show how these results can be used to recover slicing and distance inequalities. We also prove a sharp upper estimate for the outer volume ratio…
In this paper we study geometric coincidence problems in the spirit of the following problems by B. Gr\"unbaum: How many affine diameters of a convex body in $\mathbb R^n$ must have a common point? How many centers (in some sense) of…
We study the problem of existence of isoperimetric regions for large volumes, in $C^0$-locally asymptotically Euclidean Riemannian manifolds with a finite number of $C^0$-asymptotically Schwarzschild ends. Then we give a geometric…
This article is about inverse spectral problems for hyperbolic surfaces and in particular how length spectra relate to the geometry of the underlying surface. A quantitative answer is given to the following: how many questions do you need…
We describe the first-order variations of the angles of Euclidean, spherical or hyperbolic polygons under infinitesimal deformations such that the lengths of the edges do not change. Using this description, we introduce a vector-valued…
We study the problem of finding maximum-area triangles that can be inscribed in a polygon in the plane. We consider eight versions of the problem: we use either convex polygons or simple polygons as the container; we require the triangles…
We explore the Steklov eigenvalue problem on convex polygons, focusing mainly on the inverse Steklov problem. Our primary finding reveals that, for almost all convex polygonal domains, there exist at most finitely many non-congruent domains…
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…
We will first solve the following problem analytically: given a piece of wire of specified length, we will find where the wire should be cut and bent to form two regular polygons not necessarily having the same number of sides, so that the…
The paper is devoted to the relaxation and integral representation in the space of functions of bounded variation for an integral energy arising from optimal design problems. The presence of a perimeter penalization is also considered in…
We prove general theorems for isoperimetric problems on lattices of the form ${\mathbb{Z}}^{k} \times {\mathbb{N}}^{d}$ which state that the perimeter of the optimal set is a monotonically increasing function of the volume under certain…
In this paper, we consider a maximizing problem associated with the Sobolev type embedding on the space of bounded variation. We show that, although the maximizing problem suffers from both of the non-compactness of vanishing and…