Related papers: The polytopes in a Poisson hyperplane tessellation

Let $X$ be the mosaic generated by a stationary Poisson hyperplane process $\hat X$ in ${\mathbb R}^d$. Under some mild conditions on the spherical directional distribution of $\hat X$ (which are satisfied, for example, if the process is…

Let $Z$ be the typical cell of a stationary Poisson hyperplane tessellation in $\mathbb{R}^d$. The distribution of the number of facets $f(Z)$ of the typical cell is investigated. It is shown, that under a well-spread condition on the…

A generalized version of a well-known problem of D. G. Kendall states that the zero cell of a stationary Poisson hyperplane tessellation in ${\mathbb{R}}^d$, under the condition that it has large volume, approximates with high probability a…

We consider a stationary Poisson hyperplane process with given directional distribution and intensity in $d$-dimensional Euclidean space. Generalizing the zero cell of such a process, we fix a convex body $K$ and consider the intersection…

Given a stationary and isotropic Poisson hyperplane process and a convex body $K$ in ${\mathbb R}^d$, we consider the random polytope defined by the intersection of all closed halfspaces containing $K$ that are bounded by hyperplanes of the…

Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper,…

We show that for fixed $d>3$ and $n$ growing to infinity there are at least $(n!)^{d-2 \pm o(1)}$ different labeled combinatorial types of $d$-polytopes with $n$ vertices. This is about the square of the previous best lower bounds. As an…

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

This paper deals with the typical cell in a Poisson line tessellation in the plane whose directional distribution is concentrated on three equally spread values with possibly different weights. Such a random polygon can only be a triangle,…

We observe stationary random tessellations $X=\{\Xi_n\}_{n\ge1}$ in $\mathbb{R}^d$ through a convex sampling window $W$ that expands unboundedly and we determine the total $(k-1)$-volume of those $(k-1)$-dimensional manifold processes which…

The lower-dimensional maximal polytopes associated with an iteration stable (STIT) tessellation in $\RR^d$ are considered. They arise in the spatio-temporal construction process of such a tessellation as intersections of $(d-1)$-dimensional…

A natural model for the approximation of a convex body $K$ in $\mathbb{R}^d$ by random polytopes is obtained as follows. Take a stationary Poisson hyperplane process in the space, and consider the random polytope $Z_K$ defined as the…

Let $\mu$ be a probability distribution on $\mathbb{R}^d$ which assigns measure zero to every hyperplane and $S$ a set of points sampled independently from $\mu$. What can be said about the expected combinatorial structure of the convex…

For polyhedral convex cones in ${\mathbb R}^d$, we give a proof for the conic kinematic formula for conic curvature measures, which avoids the use of characterization theorems. For the random cones defined as typical cones of an isotropic…

The convex hull generated by the restriction to the unit ball of a stationary Poisson point process in the $d$-dimensional Euclidean space is considered. By establishing sharp bounds on cumulants, exponential estimates for large deviation…

Sometimes, it is possible to represent a complicated polytope as a projection of a much simpler polytope. To quantify this phenomenon, the extension complexity of a polytope $P$ is defined to be the minimum number of facets of a (possibly…

Stationary Poisson processes of lines in the plane are studied whose directional distributions are concentrated on $k \ge 3$ equally spread directions. The random lines of such processes decompose the plane into a collection of random…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

Let N > n, and denote by K the convex hull of N independent standard gaussian random vectors in an n-dimensional Euclidean space. We prove that with high probability, the isotropic constant of K is bounded by a universal constant. Thus we…

Stationary and isotropic iteration stable random tessellations are considered, which can be constructed by a random process of cell division. The collection of maximal polytopes at a fixed time $t$ within a convex window $W\subset{\Bbb…