Related papers: Towards the methodology for solving the minimum en…
This paper presents a methodology for solving a geometrically robust least squares problem, which arises in various applications where the model is subject to geometric constraints. The problem is formulated as a minimax optimization…
In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the…
Let P be a set of n points in R^3. The 2-center problem for P is to find two congruent balls of minimum radius whose union covers P. We present two randomized algorithms for computing a 2-center of P. The first algorithm runs in O(n^3 log^5…
The classical isoperimetric inequality in R^3 states that the surface of smallest area enclosing a given volume is a sphere. We show that the least area surface enclosing two equal volumes is a double bubble, a surface made of two pieces of…
We prove bounds for the covering numbers of classes of convex functions and convex sets in Euclidean space. Previous results require the underlying convex functions or sets to be uniformly bounded. We relax this assumption and replace it…
Given a compact surface with boundary, we introduce a family of functionals on the space of its Riemannian metrics, defined via eigenvalues of a Steklov-type problem. We prove that each such functional is uniformly bounded from above, and…
The contact number of a packing of finitely many balls in Euclidean $d$-space is the number of touching pairs of balls in the packing. A prominent subfamily of sphere packings is formed by the so-called totally separable sphere packings:…
We present filling as a new type of spatial subdivision problem that is related to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most…
Solving the Plateau problem means to find the surface with minimal area among all surfaces with a given boundary. Part of the problem actually consists of giving a suitable definition to the notions of 'surface', 'area' and 'boundary'. In…
We present filling as a type of spatial subdivision problem similar to covering and packing. Filling addresses the optimal placement of overlapping objects lying entirely inside an arbitrary shape so as to cover the most interior volume. In…
We prove that the area of a free boundary minimal surface $\Sigma^2 \subset B^n$, where $B^n$ is a geodesic ball contained in a round hemisphere $\mathbb{S}^n_+$, is at least as big as that of a geodesic disk with the same radius as $B^n$;…
The aim of this paper is to prove isoperimetric inequalities for simplices and polytopes with $d+2$ vertices in Euclidean, spherical and hyperbolic $d$-space. In particular, we find the minimal volume $d$-dimensional hyperbolic simplices…
Lebesgue's universal covering problem is re-examined using computational methods. This leads to conjectures about the nature of the solution which if correct could provide a blueprint for a complete solution. Empirical lower bounds for the…
We derive the closed form solutions for the surface area, the capacitance and the demagnetizing factors of the ellipsoid immersed in the Euclidean space R^3. The exact solutions for the above geometrical and physical properties of the…
We consider the minimum energy problem on the unit sphere $\mathbb S^{d-1}$ in the Euclidean space $\mathbb R^d$, $d\geq 3$, in the presence of an external field $Q$, where the charges are assumed to interact according to Newtonian…
Given a closed oriented manifold or more generally a group homology class, we introduce the spherical Plateau problem, which is a variational problem corresponding to a topological invariant called the spherical volume. In principle, its…
We provide a probabilistic approach to studying minimal surfaces in three-dimensional Euclidean space. Following a discussion of the basic relationship between Brownian motion on a surface and minimality of the surface, we introduce a way…
Consider a set $P$ of $n$ points in $\mathbb{R}^d$. In the discrete median line segment problem, the objective is to find a line segment bounded by a pair of points in $P$ such that the sum of the Euclidean distances from $P$ to the line…
The search for a point set configurations of the R^3 space which contains the smallest value of the Euclidean Steiner Ratio is almost finished. In the present work we introduce some analytical methods which aim to support a famous…
We introduce canonical principal parameters on any strongly regular minimal surface in the three dimensional sphere and prove that any such a surface is determined up to a motion by its normal curvature function satisfying the Sinh-Poisson…