Few cuts meet many point sets
From MaRDI portal
Publication:2696278
DOI10.1007/s00453-022-01059-yOpenAlexW2885480563MaRDI QIDQ2696278
Mitchell Jones, Sariel Har-Peled
Publication date: 11 April 2023
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.03260
Cites Work
- Generalized ham-sandwich cuts
- Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
- Algorithms for ham-sandwich cuts
- An analysis of the greedy algorithm for the submodular set covering problem
- Equipartition of mass distributions by hyperplanes
- On separating points by lines
- Multilevel polynomial partitions and simplified range searching
- Slicing convex sets and measures by a hyperplane
- Approximation algorithms for covering/packing integer programs
- Generalized sandwich theorems
- Thieves can make sandwiches
- Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications
- Ham-Sandwich Cuts and Center Transversals in Subspaces
- On Partial Covering For Geometric Set Systems
- On Range Searching with Semialgebraic Sets. II
- Polynomial Methods and Incidence Theory