Covering a bichromatic point set with two disjoint monochromatic disks

DOI10.1016/j.comgeo.2012.06.002zbMath1257.68146OpenAlexW2013012578MaRDI QIDQ1931262

Sergio Cabello, Pablo Pérez-Lantero, José-Miguel Díaz-Báñez

Publication date: 25 January 2013

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

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

zbMATH Keywords

approximation algorithmsgeometric optimizationdiskscovering problem

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Randomized algorithms (68W20)

Related Items (3)

Variations of largest rectangle recognition amidst a bichromatic point set ⋮ Placing Two Axis-Parallel Squares to Maximize the Number of Enclosed Points ⋮ The most points connected-covering problem with two disks

This page was built for publication: Covering a bichromatic point set with two disjoint monochromatic disks