On the complexity of the \(k\)-level in arrangements of pseudoplanes
From MaRDI portal
Publication:2022137
DOI10.1016/j.disc.2021.112354zbMath1462.52039arXiv1903.07196OpenAlexW2921083507MaRDI QIDQ2022137
Publication date: 28 April 2021
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.07196
Cites Work
- On levels in arrangements of surfaces in three dimensions
- \(k\)-sets in four dimensions
- Topologically sweeping an arrangement
- Three points do not determine a (pseudo-) plane
- Counting triangle crossings and halving planes
- On levels in arrangements of lines, segments, planes, and triangles
- Improved bounds for planar \(k\)-sets and related problems
- A characterization of planar graphs by pseudo-line arrangements
- Applications of random sampling in computational geometry. II
- On the number of halving planes
- An Improved Bound for k-Sets in Four Dimensions
- Crossing-Free Subgraphs
- Pseudo-Line Arrangements: Duality, Algorithms, and Applications
- Point sets with many \(k\)-sets
- An improved bound for \(k\)-sets in three dimensions
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the complexity of the \(k\)-level in arrangements of pseudoplanes
