An Improved Bound for k-Sets in Four Dimensions
From MaRDI portal
Publication:3068817
DOI10.1017/S0963548310000143zbMath1211.68475OpenAlexW1984798955MaRDI QIDQ3068817
Publication date: 17 January 2011
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548310000143
Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (7)
A survey of mass partitions ⋮ Dense point sets with many halving lines ⋮ On levels in arrangements of surfaces in three dimensions ⋮ The projection median of a set of points in \({\mathbb{R}}^{d}\) ⋮ On the complexity of the \(k\)-level in arrangements of pseudoplanes ⋮ Unnamed Item ⋮ The convex dimension of hypergraphs and the hypersimplicial Van Kampen-Flores theorem
Cites Work
- \(k\)-sets in four dimensions
- The colored Tverberg's problem and complexes of injective functions
- On levels in arrangements of lines, segments, planes, and triangles
- Improved bounds for planar \(k\)-sets and related problems
- In between \(k\)-sets, \(j\)-facets, and \(i\)-faces: \((i,j)\)-partitions
- Point sets with many \(k\)-sets
- An improved bound for \(k\)-sets in three dimensions
This page was built for publication: An Improved Bound for k-Sets in Four Dimensions
