Related papers: Slices, slabs, and sections of the unit hypercube
We consider a generalization of the hyperplane problem to arbitrary measures in place of volume and to sections of lower dimensions. We prove this generalization for unconditional convex bodies and for duals of bodies with bounded volume…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We study the slices or sections of a convex polytope by affine hyperplanes. We present results on two key problems: First, we provide tight bounds on the maximum number of vertices attainable by a hyperplane slice of $d$-polytope (a sort of…
There is an elegant expression for the volume of hypercube $[0,1]^n$ clipped by a single hyperplane. In the article the formula is generalized to the case of more than one hyperplane. An important foundation for the result is Lawrence's…
In this paper we deal with problems concerning the volume of the convex hull of two "connecting" bodies. After a historical background we collect some results, methods and open problems, respectively.
We show that the hyperplane conjecture holds for the classes of $k$-intersection bodies with arbitrary measures in place of volume.
We investigate the intersection body of a convex polytope using tools from combinatorics and real algebraic geometry. In particular, we show that the intersection body of a polytope is always a semialgebraic set and provide an algorithm for…
We give a deterministic method of quasi-polynomial complexity to approximate the volume of the intersection of the unit hypercube with two specific sets. The method can actually be applied (without losing the quasi-polynomial complexity) to…
In connection with an unsolved problem of Bang (1951) we give a lower bound for the sum of the base volumes of cylinders covering a d-dimensional convex body in terms of the relevant basic measures of the given convex body. As an…
We state a general formula to compute the volume of the intersection of the regular $n$-simplex with some $k$-dimensional subspace. It is known that for central hyperplanes the one through the centroid containing $n-1$ vertices gives the…
We present a complete computational classification of the combinatorial types of hyperplane sections, or slices, of the regular cube up to dimension six. For each dimension, we determine the exact number of distinct combinatorial types.…
We provide a formula to compute the volume of the intersection of a generalized cylinder with a hyperplane. Then we prove an integral inequality involving Bessel functions similar to Keith Ball's well-known inequality. Using this inequality…
We determine the maximal hyperplane sections of the regular $n$-simplex, if the distance of the hyperplane to the centroid is fairly large, i.e. larger than the distance of the centroid to the midpoint of edges. Similar results for the…
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…
This article is a survey of recent results on slicing inequalities for convex bodies. The focus is on the setting of arbitrary measures in place of volume.
The manuscript provides formulas for the volume of a body defined by the intersection of a solid cone and a solid sphere as a function of the sphere radius, of the distance between cone apex and sphere center, and of the cone aperture…
In this note we investigate the behavior of the volume that the convex hull of two congruent and intersecting simplices in Euclidean $n$-space can have. We prove some useful equalities and inequalities on this volume. For the regular…
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…
In this note we examine the volume of the convex hull of two congruent copies of a convex body in Euclidean $n$-space, under some subsets of the isometry group of the space. We prove inequalities for this volume if the two bodies are…
We use a combinatorial approximation of the hyperbolic plane to investigate properties of hyperbolic geometry such as exponential growth of perimeter and area of disks, and the linear isoperimetric inequality. This calculations give a…