Related papers: Ball-Polyhedra
Let $C\subset {\mathbb R}^n$ be a convex body. We introduce two notions of convexity associated to C. A set $K$ is $C$-ball convex if it is the intersection of translates of $C$, or it is either $\emptyset$, or ${\mathbb R}^n$. The $C$-ball…
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…
A ball-polyhedron is the intersection with non-empty interior of finitely many (closed) unit balls in Euclidean 3-space. One can represent the boundary of a ball-polyhedron as the union of vertices, edges, and faces defined in a rather…
The notion of ball convexity, considered in finite dimensional real Banach spaces, is a natural and useful extension of usual convexity; one replaces intersections of half-spaces by suitable intersections of balls. A subset $S$ of a normed…
A very fundamental geometric problem on finite systems of spheres was independently phrased by Kneser (1955) and Poulsen (1954). According to their well-known conjecture if a finite set of balls in Euclidean space is repositioned so that…
A ball polyhedron is the intersection of a finite number of closed balls in $\mathbb{R}^3$ with the same radius. In this note, we study ball polyhedra in which the set of centers defining the balls have the maximum possible number of…
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, Euclidean and…
For a given $\lambda >0$, a convex body in $\mathbb R^n$ is $\lambda$-convex if it is the intersection of (finitely or infinitely many) balls of radius $1/\lambda$. In this note, we show that among all $\lambda$-convex bodies in $\mathbb…
A ball polyhedron is a finite intersection of congruent balls in $\mathbb{R}^3$. These shapes arise in various contexts in discrete and convex geometry. We focus on Reuleaux polyhedra, the subclass of ball polyhedra whose centers and…
We investigate the intersections of balls of radius $r$, called $r$-ball bodies, in Euclidean $d$-space. An $r$-lense (resp., $r$-spindle) is the intersection of two balls of radius $r$ (resp., balls of radius $r$ containing a given pair of…
In this paper we discuss a couple of observations related to polynomial convexity. More precisely, (i) We observe that the union of finitely many disjoint closed balls with centres in $\cup_{\theta\in[0,\pi/2]}e^{i\theta}V$ is polynomially…
A "spectral convex set" is a collection of symmetric matrices whose range of eigenvalues form a symmetric convex set. Spectral convex sets generalize the Schur-Horn orbitopes studied by Sanyal-Sottile-Sturmfels (2011). We study this class…
Similarly to the classic notion in $E^d$, a subset of a positive diameter below $\frac{\pi}{2}$ of a hemisphere of the sphere $S^d$ is called complete, provided adding any extra point increases its diameter. Complete sets are convex bodies…
The space of shapes of a polyhedron with given total angles less than 2\pi at each of its n vertices has a Kaehler metric, locally isometric to complex hyperbolic space CH^{n-3}. The metric is not complete: collisions between vertices take…
We derive an upper bound on the size of a ball such that the image of the ball under quadratic map is strongly convex and smooth. Our result is the best possible improvement of the analogous result by Polyak in the case of quadratic map. We…
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…
A convex polygon is defined as a sequence (V_0,...,V_{n-1}) of points on a plane such that the union of the edges [V_0,V_1],..., [V_{n-2},V_{n-1}], [V_{n-1},V_0] coincides with the boundary of the convex hull of the set of vertices…
If the n-dimensional unit sphere is covered by finitely many spherically convex bodies, then the sum of the inradii of these bodies is at least {\pi}. This bound is sharp, and the equality case is characterized.
This work provides two sufficient conditions in terms of sections or projections for a convex body to be a polytope. These conditions are necessary as well.
Let us have in S^2, R^2 or H^2 a pair of convex bodies, for S^2 different from S^2, such that the intersections of any congruent copies of them are centrally symmetric. Then our bodies are congruent circles. If the intersections of any…