On the coarseness of bicolored point sets

DOI10.1016/j.comgeo.2012.04.003zbMath1251.05026OpenAlexW1969089430MaRDI QIDQ714904

Pablo Pérez-Lantero, Sergey Bereg, José-Miguel Díaz-Báñez, Dolores Lara, Jorge Urrutia, Carlos Seara

Publication date: 12 October 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2012.04.003

zbMATH Keywords

algorithmsclusteringdiscrepancyred-blue separability

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25)

Related Items

Separability of imprecise points, Diverse partitions of colored points, Discrete geometry on colored point sets in the plane -- a survey, Maximum-weight planar boxes in \(O(n^2)\) time (and better), New results on the coarseness of bicolored point sets, Computing the coarseness with strips or boxes