Dense point sets with many halving lines
From MaRDI portal
Publication:2207605
DOI10.1007/s00454-019-00080-3zbMath1462.52027arXiv1704.00229OpenAlexW2963824168MaRDI QIDQ2207605
Publication date: 23 October 2020
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.00229
Related Items (1)
Cites Work
- An upper bound on the number of planar \(K\)-sets
- Cutting dense point sets in half
- Improved bounds for planar \(k\)-sets and related problems
- On the number of line separations of a finite set in the plane
- Optimal bounds for the colored Tverberg problem
- Über die dichteste Kugellagerung
- An Improved Bound for k-Sets in Four Dimensions
- Point sets with many \(k\)-sets
- An improved bound for \(k\)-sets in three dimensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Dense point sets with many halving lines
