English
Related papers

Related papers: Ball polytopes and the Vazsonyi problem

200 papers

We obtain a sharp characterization of the Euclidean ball among all convex bodies K whose boundary has a pointwise k-th mean curvature not smaller than a geometric constant at almost all normal points. This geometric constant depends only on…

Differential Geometry · Mathematics 2020-10-30 Mario Santilli

We revisit an ingenious argument of K. Ball to provide sharp estimates for the volume of sections of a convex body in John's position. Our technique combines the geometric Brascamp-Lieb inequality with a generalised Parseval-type identity.…

Metric Geometry · Mathematics 2026-03-31 David Alonso-Gutiérrez , Silouanos Brazitikos , Giorgos Chasapis

In (the surface of) a convex polytope P^n in R^n+1, for small prescribed volume, geodesic balls about some vertex minimize perimeter. This revision corrects a mistake in the mass bound argument in the proof of Theorem 3.8.

Metric Geometry · Mathematics 2007-05-23 Frank Morgan

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…

Metric Geometry · Mathematics 2026-01-21 Ryan Hynd

In this paper we investigate the problem of finding the maximum volume polytopes, inscribed in the unit sphere of the $d$-dimensional Euclidean space, with a given number of vertices. We solve this problem for polytopes with $d+2$ vertices…

Metric Geometry · Mathematics 2014-07-11 Ákos G. Horváth , Zsolt Lángi

We prove explicit bounds on the radius of a ball centered at the origin which is guaranteed to contain all bounded connected components of a semi-algebraic set $S \subset \mathbbm{R}^k$ defined by a quantifier-free formula involving $s$…

Symbolic Computation · Computer Science 2011-02-02 Saugata Basu , Marie-Francoise Roy

The paper is devoted to some extremal problems, related to convex polygons in the Euclidean plane and their perimeters. We present a number of results that have simple formulations, but rather intricate proofs. Related and still unsolved…

Metric Geometry · Mathematics 2023-11-28 Yu. G. Nikonorov , O. Yu. Nikonorova

In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…

Optimization and Control · Mathematics 2023-10-09 Marius Costandin , Beniamin Costandin

The paper is devoted to some extremal problems for convex curves and polygons in the Euclidean plane referring to the relative Chebyshev radius. In particular, we determine the relative Chebyshev radius for an arbitrary triangle. Moreover,…

Metric Geometry · Mathematics 2021-09-28 Vitor Balestro , Horst Martini , Yurii Nikonorov , Yulia Nikonorova

A polytope in a finite-dimensional normed space is subequilateral if the length in the norm of each of its edges equals its diameter. Subequilateral polytopes occur in the study of two unrelated subjects: surface energy minimizing cones and…

Metric Geometry · Mathematics 2007-05-23 Konrad J Swanepoel

A new intrinsic volume metric is introduced for the class of convex bodies in $\mathbb{R}^n$. As an application, an inequality is proved for the asymptotic best approximation of the Euclidean unit ball by arbitrarily positioned polytopes…

Metric Geometry · Mathematics 2023-03-15 Florian Besau , Steven Hoehner

In this paper, we study a partially overdetermined mixed boundary value problem in a half ball. We prove that a domain in which this partially overdetermined problem admits a solution if and only if the domain is a spherical cap…

Analysis of PDEs · Mathematics 2019-08-08 Jinyu Guo , Chao Xia

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…

Metric Geometry · Mathematics 2013-02-13 Karoly Bezdek

Consider a random set of points on the unit sphere in $\mathbb{R}^d$, which can be either uniformly sampled or a Poisson point process. Its convex hull is a random inscribed polytope, whose boundary approximates the sphere. We focus on the…

Metric Geometry · Mathematics 2020-07-16 Arseniy Akopyan , Herbert Edelsbrunner , Anton Nikitenko

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…

Probability · Mathematics 2021-03-03 Steven D. Hoehner , Carsten Schuett , Elisabeth M. Werner

We conjecture that a convex polytope is uniquely determined up to isometry by its edge-graph, edge lengths and the collection of distances of its vertices to some arbitrary interior point, across all dimensions and all combinatorial types.…

Combinatorics · Mathematics 2024-01-09 Martin Winter

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…

Differential Geometry · Mathematics 2007-05-23 Manuel Ritoré , César Rosales

The problem of covering a region of the plane with a fixed number of minimum-radius identical balls is studied in the present work. An explicit construction of bi-Lipschitz mappings is provided to model small perturbations of the union of…

Optimization and Control · Mathematics 2023-04-28 Ernesto G. Birgin , Antoine Laurain , Rafael Massambone , Arthur G. Santana

We prove the following local version of Blaschke--Kakutani's characterization of ellipsoids: Let $V$ be a finite-dimensional real vector space, $B\subset V$ a convex body with 0 in its interior, and ${2\le k<\dim V}$ an integer. Suppose…

Metric Geometry · Mathematics 2025-04-22 Sergei Ivanov , Daniil Mamaev , Anya Nordskova

For a graph whose vertex set is a finite set of points in the Euclidean $d$-space consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect.…

Combinatorics · Mathematics 2022-08-10 Olimjoni Pirahmad , Alexandr Polyanskii , Alexey Vasilevskii
‹ Prev 1 3 4 5 6 7 10 Next ›