Red-blue rectangular annulus cover problem

DOI10.1007/978-3-031-39344-0_15MaRDI QIDQ6535815zbMATH OpenFDO

Authors Sukanya Maji, Supantha Pandit, Sanjib Sadhu

Publication date 28 February 2024

Full work available at URL https://doi.org/10.1007/978-3-031-39344-0_15

zbMATH Keywords

annulus coverbichromatic point setpolynomial-time algorithmsrectangular annulus

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Nonnumerical algorithms (68W05)

Recommendations

• Covering point sets with two disjoint disks or squares
• Geometric red-blue set cover for unit squares and related problems
• Maximum-width rainbow-bisecting empty annulus
• The class cover problem with boxes
• Minimum-width rectangular annulus

Cites work

• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Computational geometry. Algorithms and applications.
• Computing a minimum-width square annulus in arbitrary orientation
• Computing a minimum-width square or rectangular annulus with outliers
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Finding the maximum empty axis-parallel rectangular annulus
• Geometric separability using orthogonal objects
• scientific article; zbMATH DE number 43279 (Why is no real title available?)
• Maximum-width empty square and rectangular annulus
• Minimum-width rectangular annulus
• Offset polygon and annulus placement problems
• THE LARGEST EMPTY ANNULUS PROBLEM

This page was built for publication: Red-blue rectangular annulus cover problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535815)