scientific article; zbMATH DE number 3271295

Ludwig Danzer, Victor Klee, Branko Grünbaum

Publication date: 1968

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

metric geometry, convex geometry, integral geometry

Related Items (56)

Can you cover your shadows? ⋮ Using \(\varepsilon\)-nets for linear separation of two sets in a Euclidean space \(\mathbb R^d\) ⋮ Flat transversals to flats and convex sets of a fixed dimension ⋮ Helly and Klee type intersection theorems for finitary connected paved spaces ⋮ Geometric permutations of disjoint translates of convex sets ⋮ Computing the volume is difficult ⋮ Approximation and inapproximability results for maximum clique of disc graphs in high dimensions ⋮ Rich cells in an arrangement of hyperplanes ⋮ Nearly-neighborly families of tetrahedra and the decomposition of some multigraphs ⋮ On the geometric separability of Boolean functions ⋮ Minimal ellipsoids and their duals ⋮ Kinematic formulas for finite vector spaces ⋮ Staircase kernels for orthogonal \(d\)-polytopes ⋮ Largest \(j\)-simplices in \(d\)-cubes: Some relatives of the Hadamard maximum determinant problem ⋮ Lexocographic multipliers ⋮ Erdős-Szekeres ``happy end-type theorems for separoïds ⋮ Minkowski addition of \(H\)-convex sets and related Helly-type theorems. ⋮ k-dimensional intersections of convex sets and convex kernels ⋮ Euler characteristic and multiple coverings ⋮ On some combinatorial questions in finite-dimensional spaces ⋮ On the construction of bodies of constant width containing a given set ⋮ On learning a union of half spaces ⋮ Algorithms for high dimensional stabbing problems ⋮ A generalization of Caratheodory's theorem ⋮ Ordered stabbing of pairwise disjoint convex sets in linear time ⋮ A Helly-type theorem for intersections of orthogonally starshaped sets in \(\mathbb R^d\) ⋮ On the exchange and distributivity numbers in geometric lattices ⋮ On the class of restricted linear information systems ⋮ Geometric orderings of intersecting translates and their applications ⋮ Suitable families of boxes and kernels of staircase starshaped sets in \(\mathbb{R}^d\) ⋮ Carathéodory's theorem and \(H\)-convexity ⋮ A generalization of the ham sandwich theorem ⋮ Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem ⋮ Geometric permutations for convex sets ⋮ Some partitions associated with a partially ordered set ⋮ On formal fractions associated with the symmetric groups ⋮ Gallai-type results for multiple boxes and forests ⋮ A Helly-type theorem for higher-dimensional transversals ⋮ Minkowski's theorem for arbitrary convex sets ⋮ Properties of systems of \(n\)-dimensional convex sets in finite-dimensional linear spaces ⋮ Strictly antipodal sets ⋮ A Helly type theorem for hypersurfaces ⋮ The structure of Sperner k-families ⋮ On the extension of Lipschitz-Hölder maps of order \(\beta\) ⋮ Counting polytopes via the Radon complex ⋮ Applications of semidefinite programming ⋮ Generalized rational approximation in interpolating subspaces of L\(_p(\mu\)) ⋮ Cutting rectangles in the plane ⋮ Combinatorial geometry ⋮ Estimate of deviation of fixed points from a nonconvex set ⋮ Ensemble convexes dans les graphes. I: Théoremes de Helly et de Radon pour graphes et surfaces ⋮ Covering and coloring problems for relatives of intervals ⋮ A combinatorial perspective on the non-Radon partitions ⋮ An extension of Jung's theorem ⋮ Embedding of a homothete in a convex compactum: an algorithm and its convergence ⋮ Staircase convex results for a certain class of orthogonal polytopes

This page was built for publication: