Related papers: Algebraic methods for computing smallest enclosing…
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…
Extending an example by Colding and Minicozzi, we construct a sequence of properly embedded minimal disks $\Sigma_i$ in an infinite Euclidean cylinder around the $x_3$-axis with curvature blow-up at a single point. The sequence converges to…
We study the problem of covering a given set of $n$ points in a high, $d$-dimensional space by the minimum enclosing polytope of a given arbitrary shape. We present algorithms that work for a large family of shapes, provided either only…
In the present paper, we discuss the singular minimal surfaces in a Euclidean 3-space R^{3} which are minimal. In fact, such a surface is nothing but a plane, a trivial outcome. However, a non-trivial outcome is obtained when we modify the…
The three-dimensional cylindrical regression problem is a problem of finding a cylinder best fitting a group of points in three-dimensional Euclidean space. The words best fitting are usually understood in the sense of the minimum root mean…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…
We give a classification of the graded simple modules of cyclotomic quiver Hecke algebras of type A using the diagram calculus of the diagrammatic Cherednik algebra. We also obtain a non-trivial lower bound for the dimension of the simple…
An n-simplex is called circumscriptible (or edge-incentric) if there is a sphere tangent to all its n(n + 1)/2 edges. We obtain a closed formula for the radius of the circumscribed sphere of the circumscriptible n-simplex, and also prove a…
We present uniqueness results for enclosing ellipses of minimal area in the hyperbolic plane. Uniqueness can be guaranteed if the minimizers are sought among all ellipses with prescribed axes or center. In the general case, we present a…
We show that directed minimal cones in (n+1)-dimensional Euclidean space which have at most one singularity are - besides the trivial cases: empty set, whole space - half spaces. Using blow-up techniques, this result can be used to get…
We give an estimate of the mean curvature of a complete submanifold lying inside a closed cylinder $B(r)\times\R^{\ell}$ in a product Riemannian manifold $N^{n-\ell}\times\R^{\ell}$. It follows that a complete hypersurface of given constant…
For any prescribed closed subset of a line segment in Euclidean 3-space, we construct a sequence of minimal disks that are properly embedded in an open solid cylinder around the segment and that have curvatures blowing up precisely at the…
In many singular metric spaces, the regularity of a shortest-length curve is unknown. Algebraic varieties, or more generally sets defined by finitely many polynomial or real analytic equalities or inequalities, all locally partition into…
Given $n$ points in a $d$ dimensional Euclidean space, the Minimum Enclosing Ball (MEB) problem is to find the ball with the smallest radius which contains all $n$ points. We give a $O(nd\Qcal/\sqrt{\epsilon})$ approximation algorithm for…
We discover some very general configuration results for constructing area-minimizing cones. In particular, given any closed minimal submanifold in some Euclidean sphere, every cone over the minimal product of sufficiently many copies of the…
A partial formula is provided to calculate the smallest number of vertices possible in a quadrangulation on the closed orientable 2-manifold of given genus. This extends the previously known partial formula due to N. Hartsfield and G.…
The smallest enclosing circle problem asks for the circle of smallest radius enclosing a given set of finite points on the plane. This problem was introduced in the 19th century by Sylvester [17]. After more than a century, the problem…
We give a complete topological classification of minimal surfaces in Euclidian three-space.
We overview the volume calculations for polyhedra in Euclidean, spherical and hyperbolic spaces. We prove the Sforza formula for the volume of an arbitrary tetrahedron in $H^3$ and $S^3$. We also present some results, which provide a…