Dynamic Minimum Bichromatic Separating Circle

DOI10.1007/978-3-319-26626-8_50zbMath1478.90100OpenAlexW2407501706MaRDI QIDQ3467880

Bogdan Armaselu, Ovidiu Daescu

Publication date: 5 February 2016

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26626-8_50

zbMATH Keywords

dynamicbichromaticseparating circle

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Geometric red-blue set cover for unit squares and related problems
• Maximum-weight planar boxes in \(O(n^2)\) time (and better)
• Polygonal path simplification with angle constraints
• Kinetic Red-Blue Minimum Separating Circle

This page was built for publication: Dynamic Minimum Bichromatic Separating Circle