Related papers: Smallest Intersecting and Enclosing Balls
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…
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…
Approximating convex bodies is a fundamental problem in geometry. Given a convex body $K$ in $\mathbb{R}^d$ for a fixed dimension $d$, the objective is to minimize the number of facets of an approximating polytope for a given Hausdorff…
Cooperative games with nonempty core are called balanced, and the set of balanced games is a polyhedron. Given a game with empty core, we look for the closest balanced game, in the sense of the (weighted) Euclidean distance, i.e., the…
We provide an algebraic framework to compute smallest enclosing and smallest circumscribing cylinders of simplices in Euclidean space $\E^n$. Explicitly, the computation of a smallest enclosing cylinder in $\mathbb{E}^3$ is reduced to the…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
We study the geometric knapsack problem in which we are given a set of $d$-dimensional objects (each with associated profits) and the goal is to find the maximum profit subset that can be packed non-overlappingly into a given…
Globally non-positively curved, or CAT(0), polyhedral complexes arise in a number of applications, including evolutionary biology and robotics. These spaces have unique shortest paths and are composed of Euclidean polyhedra, yet many…
An $\epsilon$-approximate incidence between a point and some geometric object (line, circle, plane, sphere) occurs when the point and the object lie at distance at most $\epsilon$ from each other. Given a set of points and a set of objects,…
We present a game inspired by research on the possible number of billiard ball collisions in the whole Euclidean space. One player tries to place $n$ static "balls" with zero radius (i.e., points) in a way that will minimize the total…
Interior-point methods offer a highly versatile framework for convex optimization that is effective in theory and practice. A key notion in their theory is that of a self-concordant barrier. We give a suitable generalization of…
Min-max optimization problems arise in several key machine learning setups, including adversarial learning and generative modeling. In their general form, in absence of convexity/concavity assumptions, finding pure equilibria of the…
We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…
We consider optimization problems on manifolds with equality and inequality constraints. A large body of work treats constrained optimization in Euclidean spaces. In this work, we consider extensions of existing algorithms from the…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
We derive a mixed integer nonlinear programming formulation for the problem of finding a convex polygon with a given number of vertices that is small (diameter at most one) and has maximum perimeter. The formulation is based on a geometric…
The first two installments of this series of papers dealt with the maximum area polygons: Parallelogram, Rectangle, Square or Equilateral Triangle, in given triangles. Minimum area polygons were also considered in the second paper on…
We prove that every plane passing through the origin divides an embedded compact free boundary minimal surface of the euclidean $3$-ball in exactly two connected surfaces. We also show that if a region in the ball has mean convex boundary…
This is an expanded version of my plenary lecture at the 8th European Congress of Mathematics in Portoro\v{z} on 23 June 2021. The main part of the paper is a survey of recent applications of complex-analytic techniques to the theory of…
A subset of the d-dimensional Euclidean space having nonempty interior is called a spindle convex body if it is the intersection of (finitely or infinitely many) congruent d-dimensional closed balls. The spindle convex body is called a…