Related papers: Ball-Polyhedra

We prove that in the Hilbert space every uniformly convex set with modulus of convexity of the second order at zero is an intersection of closed balls of fixed radius. We also obtain an estimate of this radius.

Complementing our previous results, we give a classification of all isometries (not necessarily surjective) of the metric space consisting of ball-bodies, endowed with the Hausdorff metric. "Ball bodies" are convex bodies which are…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…

While there is extensive literature on approximation of convex bodies by inscribed or circumscribed polytopes, much less is known in the case of generally positioned polytopes. Here we give upper and lower bounds for approximation of convex…

If the complement of a closed convex set in a closed convex cone is bounded, then this complement minus the apex of the cone is called a coconvex set. Coconvex sets appear in singularity theory (they are closely related to Newton diagrams)…

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

Let $K$ and $L$ be two convex bodies in $\mathbb R^n$, $n\geq 2$, with $L\subset \text{int}\, K$. We say that $L$ is an equichordal body for $K$ if every chord of $K$ tangent to $L$ has length equal to a given fixed value $\lambda$. J.…

A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…

We study oriented connected closed polyhedral surfaces with non-degenerate triangular faces in three-dimensional Euclidean space, calling them polyhedra for short. A polyhedron is called flexible if its spatial shape can be changed…

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to spherical and hyperbolic planes.…

We survey the Hilbert geometry of convex polytopes. In particular we present two important characterisations of these geometries, the first one in terms of the volume growth of their metric balls, the second one as a bi-lipschitz class of…

In this paper we study the class of so called `ball-bodies' in ${\mathbb R}^n$, given by intersections of translates of Euclidean unit balls (or, equivalently, summand of the Euclidean ball). We study the class along with the natural…

Given a set of radii measured from a fixed point, the existence of a convex configuration with respect to the set of distinct radii in the two-dimensional case is proved when radii are distinct or repeated at most four points. However, we…

The convex hull of a ball with an exterior point is called a spike (or cap). A union of finitely many spikes of a ball is called a spiky ball. If a spiky ball is convex, then we call it a cap body. In this note we upper bound the…

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…

Parallel to the main results of [13] and [14], which explore the equivalence between prox-regularity, the exterior sphere condition, and $S$-convexity, we present novel characterizations of the $r$-strong convexity property, namely, of the…

The rigidity theorems of Alexandrov (1950) and Stoker (1968) are classical results in the theory of convex polyhedra. In this paper we prove analogues of them for normal (resp., standard) ball-polyhedra. Here, a ball-polyhedron means an…

In a work by Artstein-Avidan and Milman the concept of polarity is generalized from the class of convex bodies to the larger class of convex functions. While the only self-polar convex body is the Euclidean ball, it turns out that there are…

A spectrahedron is a set defined by a linear matrix inequality. Given a spectrahedron we are interested in the question of the smallest possible size $r$ of the matrices in the description by linear matrix inequalities. We show that for the…