Related papers: A minimal partition problem with trace constraint …
We study the problems of covering or partitioning a polygon $P$ (possibly with holes) using a minimum number of small pieces, where a small piece is a connected sub-polygon contained in an axis-aligned unit square. For covering, we seek to…
In this paper we consider a three dimensional Kropina space and obtain the partial differential equation that characterizes a minimal surfaces with the induced metric. Using this characterization equation we study various immersions of…
We consider the Minimum Coverage Kernel problem: given a set $B$ of $d$-dimensional boxes, find a subset of $B$ of minimum size covering the same region as $B$. This problem is $\mathsf{NP}$-hard, but as for many $\mathsf{NP}$-hard problems…
The isoperimetric problem asks for the maximum area of a region of given perimeter. It is natural to consider other measurements of a region, such as the diameter and width, and ask for the extreme value of one when another is fixed. The…
We consider the volume-constrained minimization of the sum of the perimeter and the Riesz potential. We add an external potential of the form $\|x\|^{\beta}$ that provides the existence of a minimizer for any volume constraint, and we study…
The distant graph $G = G(\mathbb{P}(Z),\triangle)$ of the projective line over the ring of integers is considered. The shortest path problem in this graph is solved by use of Klein's geometric interpretation of Euclidean continued…
For $\Omega_\e=(0,\e)\times (0,1)$ a thin rectangle, we consider minimization of the two-dimensional nonlocal isoperimetric problem given by \[ \inf_u E^{\gamma}_{\Omega_\e}(u)\] where \[ E^{\gamma}_{\Omega_\e}(u):=…
We investigate the class of geodesic metric discs satisfying a uniform quadratic isoperimetric inequality and uniform bounds on the length of the boundary circle. We show that the closure of this class as a subset of Gromov-Hausdorff space…
In the packing-constrained point covering problem, PC^2, one seeks configurations of points in the plane that cannot all be covered by a packing arrangement of unit disks. We consider in particular the problem of finding the minimum number…
We study a geometric variational problem for sets in the plane in which the perimeter and a regularized dipolar interaction compete under a mass constraint. In contrast to previously studied nonlocal isoperimetric problems, here the…
We study a general smallest intersecting ball problem and its soft-margin variant in high-dimensional Euclidean spaces for input objects that are compact and convex. These two problems link and unify a series of fundamental problems in…
The minimum $k$-enclosing ball problem seeks the ball with smallest radius that contains at least~$k$ of~$m$ given points in a general $n$-dimensional Euclidean space. This problem is NP-hard. We present a branch-and-bound algorithm on the…
The paper is devoted to some extremal problems for convex polygons on the Euclidean plane, related to the concept of self Chebyshev radius for the polygon boundary. We consider a general problem of minimization of the perimeter among all…
In this paper we solve several reverse isoperimetric problems in the class of $\lambda$-convex bodies, i.e., convex bodies whose curvature at each point of their boundary is bounded below by some $\lambda > 0$. We give an affirmative answer…
This article provides numerical evidence that under volume constraint the ball is the set which maximizes the perimeter of the least-perimeter partition into cells with prescribed areas. We introduce a numerical maximization algorithm which…
It is a well known fact that in $\mathbb{R}^n$ a subset of minimal perimeter $L$ among all sets of a given volume is also a set of maximal volume among all sets of the same perimeter $L$. This is called the reciprocity principle for…
In this paper we study the following problems: given a finite number of nonempty closed subsets of a normed space, find a ball with the smallest radius that encloses all of the sets, and find a ball with the smallest radius that intersects…
In this paper, we introduce two iterative methods for longest minimal length partition problem, which asks whether the disc (ball) is the set maximizing the total perimeter of the shortest partition that divides the total region into…
The Borsuk problem asks for the smallest number of subsets with strictly smaller diameters into which any bounded set in the $d$-dimensional space can be decomposed. It is a classical problem in combinatorial geometry that has been subject…
We consider vectorial problems in the calculus of variations with an additional pointwise constraint. Our admissible mappings ${\bf n}:\mathbb{R}^k\rightarrow \mathbb{R}^d$ satisfy ${\bf n}(x)\in M$, where $M$ is a manifold embedded in…