Red-blue rectangular annulus cover problem

DOI10.1007/978-3-031-39344-0_15zbMath1547.68792MaRDI QIDQ6535815

Sanjib Sadhu, Supantha Pandit, Sukanya Maji

Publication date: 28 February 2024

zbMATH Keywords

polynomial-time algorithmsrectangular annulusbichromatic point setannulus cover

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-width rectangular annulus
• Offset polygon and annulus placement problems
• An optimal \(O(n\log n)\) algorithm for finding an enclosing planar rectilinear annulus of minimum width
• Establishment of a pair of concentric circles with the minimum radial separation for assessing roundness error
• Computing a minimum-width square or rectangular annulus with outliers
• Computing a minimum-width square annulus in arbitrary orientation
• Finding the maximum empty axis-parallel rectangular annulus
• Geometric separability using orthogonal objects
• THE LARGEST EMPTY ANNULUS PROBLEM
• Maximum-width empty square and rectangular annulus

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