Related papers: Towards the methodology for solving the minimum en…
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…
We study the problem of existence of regions separating a given amount of volume with the least possible perimeter inside a Euclidean cone. Our main result shows that nonexistence for a given volume implies that the isoperimetric profile of…
Considering a finite intersection of balls and a finite union of other balls in an Euclidean space, we propose an exact method to test whether the intersection is covered by the union. We reformulate this problem into quadratic programming…
In this paper we develop an extremal eigenvalue approach to the problem of construction of free boundary minimal surfaces in the product of Euclidean balls of chosen radii. The extremal problem involves a linear combination of normalized…
It is proved by Brendle in [4] that the equatorial disk $D^k$ has least area among $k$-dimensional free boundary minimal surfaces in the Euclidean ball $B^n$. By comparing the excess of free boundary minimal surfaces with the excess of the…
In this survey, we discuss volumetric and combinatorial results concerning (mostly finite) intersections or unions of balls (mostly of equal radii) in the $d$-dimensional real vector space, mostly equipped with the Euclidean norm. Our first…
Given a set of $n$ points in the plane, and a parameter $k$, we consider the problem of computing the minimum (perimeter or area) axis-aligned rectangle enclosing $k$ points. We present the first near quadratic time algorithm for this…
This paper concerns the minimax center of a collection of linear subspaces. When the subspaces are $k$-dimensional subspaces of $\mathbb{R}^n$, this can be cast as finding the center of a minimum enclosing ball on a Grassmann manifold,…
The Minimum Enclosing Ball (MEB) problem is one of the most fundamental problems in clustering, with applications in operations research, statistics and computational geometry. In this works, we give the first differentially private (DP)…
In this paper, we discuss the role of the shortest distance in time-dependent enclosure method for the inverse problems when the inclusions are embedded in a non-layered or two-layered medium. Furthermore, the regularity assumptions for the…
The main goal of the paper is to solve some problems about shadow for the sphere generalized on the case of the ellipsoid. Here, the essence of the problem is to find the the minimal number of non-overlapping balls with centers on the…
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…
In this note we show existence and regularity of periodic tilings of the Euclidean space into equal cells containing a ball of fixed radius, which minimize either the classical or the fractional perimeter. We also discuss some qualitative…
Given a set $P$ of points and a set $U$ of axis-parallel unit squares in the Euclidean plane, a minimum ply cover of $P$ with $U$ is a subset of $U$ that covers $P$ and minimizes the number of squares that share a common intersection,…
We prove that a connected properly immersed minimal surface in Euclidean 3-space with infinite symmetry group whose intersection with a ball of radius R is less than 2\piR^2 is a plane, a catenoid or a Scherk singly-periodic minimal…
In this note we present the solution of some isoperimetric problems in open convex cones of $\R^n$ in which perimeter and volume are measured with respect to certain nonradial weights. Surprisingly, Euclidean balls centered at the origin…
In this article we present an elementary introduction to the theory of minimal surfaces in Euclidean spaces $\mathbb R^n$ for $n\ge 3$ by using only elementary calculus of functions of several variables at the level of a typical second-year…
This paper addresses a two-player target defense game in the $n$-dimensional Euclidean space where an attacker attempts to enter a closed convex target set while a defender strives to capture the attacker beforehand. We provide a complete…
Given an Euclidean space, this paper elucidates the topological link between the partial derivatives of the Minkowski functional associated to a set (assumed to be compact, convex, with a differentiable boundary and a non-empty interior)…
Consider the problem of finding a point in a unit $n$-dimensional $\ell_p$-ball ($p\ge 2$) such that the minimum of the weighted Euclidean distance from given $m$ points is maximized. We show in this paper that the recent…