On the coarseness of bicolored point sets
type: Item
instance of: scholarly article
title: On the coarseness of bicolored point sets
zbMATH Open document ID: 1251.05026
published in: Computational Geometry
publication date: 2012-10-12T00:00:00Z
Mathematics Subject Classification ID: 05B25
zbMATH DE Number: 6093124
zbMATH Keywords: discrepancy
zbMATH Keywords: clustering
zbMATH Keywords: algorithms
zbMATH Keywords: red-blue separability
author: Sergey Bereg
author: J. M. Díaz-Báñez
author: D. Lara
author: P. Pérez-Lantero
author: Carlos Seara
author: J. Urrutia
MaRDI profile type: Publication
full work available at URL: j.comgeo.2012.04.003
OpenAlex ID: W1969089430
DOI: 10.1016/J.COMGEO.2012.04.003
Recommended article: New results on the coarseness of bicolored point sets
Recommended article: Coloring copoints of a planar point set
Recommended article: Near equipartitions of colored point sets
Recommended article: Separating bichromatic point sets in the plane by restricted orientation convex hulls
Recommended article: Convex Quadrangulations of Bichromatic Point Sets
Recommended article: Algorithms and hardness results for nearest neighbor problems in bicolored point sets
Recommended article: Discrete geometry on colored point sets in the plane -- a survey
Recommended article: Convex equipartitions of colored point sets
Recommended article: Quasi‐random 2‐ colorings of point sets
Recommended article: Bounds for point recolouring in geometric graphs
description: scientific article; zbMATH DE number 6093124