New results on the coarseness of bicolored point sets
From MaRDI portal
Publication:522958
DOI10.1016/j.ipl.2017.02.007zbMath1431.05031arXiv1211.2020OpenAlexW2963577081MaRDI QIDQ522958
Pablo Pérez-Lantero, Ruy Fabila-Monroy, Inmaculada Ventura, José-Miguel Díaz-Báñez
Publication date: 20 April 2017
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1211.2020
Combinatorial aspects of finite geometries (05B25) Coloring of graphs and hypergraphs (05C15) Combinatorial geometries and geometric closure systems (51D20)
Related Items (2)
Discrete geometry on colored point sets in the plane -- a survey ⋮ Computing the coarseness with strips or boxes
Cites Work
- Unnamed Item
- Unnamed Item
- Computing optimal islands
- Sequential and parallel algorithms for finding a maximum convex polygon
- Sequences, discrepancies and applications
- On the coarseness of bicolored point sets
- Covering convex sets with non-overlapping polygons
- On the density and discrepancy of a 2D point set with applications to thermal analysis of VLSI chips
- An elementary approach to lower bounds in geometric discrepancy
- Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- Geometric methods in the study of irregularities of distribution
- 10.1162/153244302760200650
- Geometric discrepancy. An illustrated guide
This page was built for publication: New results on the coarseness of bicolored point sets
