相关论文: Slices, slabs, and sections of the unit hypercube
The volume cut off by a hyperplane from a bounded body with smooth boundary in $R^{2k}$ never is an algebraic function on the space of hyperplanes: for k=1 it is the famous lemma XXVIII from Newton's Principia. Following an analogy of these…
We study approximations of polytopes in the standard model for computing polytopes using Minkowski sums and (convex hulls of) unions. Specifically, we study the ability to approximate a target polytope by polytopes of a given depth. Our…
We obtain cubature formulas of volume potentials over bounded domains combining the basis functions introduced in the theory of approximate approximations with their integration over the tangential-halfspace. Then the computation is reduced…
We provide sufficient conditions for two subgroups of a hierarchically hyperbolic group to generate an amalgamated free product over their intersection. The result applies in particular to certain geometric subgroups of mapping class groups…
We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…
We study the class of (locally) anti-blocking bodies as well as some associated classes of convex bodies. For these bodies, we prove geometric inequalities regarding volumes and mixed volumes, including Godberson's conjecture, near-optimal…
We study the smallest intersecting and enclosing ball problems in Euclidean spaces for input objects that are compact and convex. They link and unify many problems in computational geometry and machine learning. We show that both problems…
We derive a formula for the spacetime volume of a small causal cone. We use this formula within the context of causal set theory to construct causal set expressions for certain geometric quantities relating to a spacetime with a spacelike…
Gr\"unbaum's inequality gives sharp bounds between the volume of a convex body and its part cut off by a hyperplane through the centroid of the body. We provide a generalization of this inequality for hyperplanes that do not necessarily…
The present article studies combinatorial tilings of Euclidean or spherical spaces by polytopes, serving two main purposes: first, to survey some of the main developments in combinatorial space tiling; and second, to highlight some new and…
We develop the calculus of superforms as a tool for convex geometry. The formalism is applied to valuations on convex bodies, the Alexandrov-Fenchel inequalities and Monge- Amp\`ere equations on the boundary of convex bodies.
Moduli spaces of hyperbolic surfaces with geodesic boundary components of fixed lengths may be endowed with a symplectic structure via the Weil-Petersson form. We show that, as the boundary lengths are sent to infinity, the Weil-Petersson…
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…
We study a family of polytopes and their duals, that appear in various optimization problems as the unit balls for certain norms. These two families interpolate between the hypercube, the unit ball for the $\infty$-norm, and its dual…
We give several new criteria to judge whether a simple convex polytope in a Euclidean space is combinatorially equivalent to a product of simplices. These criteria are mixtures of combinatorial, geometrical and topological conditions that…
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…
Covering numbers of convex bodies based on homothetical copies and related illumination numbers are well-known in combinatorial geometry and, for example, related to Hadwiger's famous covering problem. Similar numbers can be defined by…
Plank problems concern the covering of convex bodies by planks in Euclidean space and are related to famous open problems in convex geometry. In this survey, we introduce plank problems and present surprising applications of plank theorems…
The volume of a cyclic polytope can be obtained by forming an iterated integral along a suitable piecewise linear path running through its edges. Different choices of such a path are related by the action of a subgroup of the combinatorial…
We settle the existence of certain "anti-magic" cubes using combinatorial block designs and graph decompositions to align a handful of small examples.