Geometric systems of unbiased representatives
From MaRDI portal
Publication:2122784
DOI10.1016/j.ipl.2021.106232zbMath1483.68461arXiv2002.05488MaRDI QIDQ2122784
Sujoy Bhore, Leonardo Martínez-Sandoval, Aritra Banik, Bhaswar B. Bhattacharya
Publication date: 7 April 2022
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.05488
computational geometry; NP-hard problems; bicolorings; geometric ranges; systems of unbiased representatives
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
Cites Work
- Unnamed Item
- Unnamed Item
- Balanced partitions of 3-colored geometric sets in the plane
- On balanced 4-holes in bichromatic point sets
- Algorithms for ham-sandwich cuts
- Computing balanced islands in two colored point sets in the plane
- Induced-bisecting families of bicolorings for hypergraphs
- Bisecting and \(D\)-secting families for set systems
- On separating systems of a finite set
- Minimal completely separating systems
- On a problem concerning separating systems of a finite set
- Geometric discrepancy. An illustrated guide