On the coarseness of bicolored point sets
From MaRDI portal
Publication:714904
DOI10.1016/J.COMGEO.2012.04.003zbMATH Open1251.05026OpenAlexW1969089430MaRDI QIDQ714904FDOQ714904
Authors: Sergey Bereg, J. M. Díaz-Báñez, D. Lara, P. Pérez-Lantero, Carlos Seara, J. Urrutia 
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
Recommendations
- New results on the coarseness of bicolored point sets
- Coloring copoints of a planar point set
- Near equipartitions of colored point sets
- Separating bichromatic point sets in the plane by restricted orientation convex hulls
- Convex quadrangulations of bichromatic point sets
- Algorithms and hardness results for nearest neighbor problems in bicolored point sets
- Discrete geometry on colored point sets in the plane -- a survey
- Convex equipartitions of colored point sets
- Quasi‐random 2‐ colorings of point sets
- Bounds for point recolouring in geometric graphs
Cited In (7)
- Diverse partitions of colored points
- Maximum-weight planar boxes in \(O(n^2)\) time (and better)
- Discrete geometry on colored point sets in the plane -- a survey
- Computing the coarseness measure of a bicolored point set over guillotine partitions
- Separability of imprecise points
- New results on the coarseness of bicolored point sets
- Computing the coarseness with strips or boxes
This page was built for publication: On the coarseness of bicolored point sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q714904)
