Maximum-width rainbow-bisecting empty annulus

DOI10.1016/J.COMGEO.2024.102088MaRDI QIDQ6551277zbMATH OpenFDO

Authors Sang Won Bae, Sandip Banerjee, Arpita Baral, Priya Ranjan Sinha Mahapatra, Sang Duk Yoon

Publication date 6 June 2024

Published in Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

polynomial-time algorithmsgeometric coveringL shaped corridorrainbow-bisecting annulus

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Computing methodologies and applications (68Uxx)

Recommendations

• Minimum width color spanning annulus
• Minimum width color spanning annulus
• Maximum-width empty square and rectangular annulus
• Maximum-width empty square and rectangular annulus
• THE LARGEST EMPTY ANNULUS PROBLEM

Cites work

• scientific article; zbMATH DE number 1875422 (Why is no real title available?)
• Color spanning objects: algorithms and hardness results
• Computational geometry. Algorithms and applications.
• Computing the smallest color-spanning axis-parallel square
• Locating an obnoxious plane
• Maximum-width empty square and rectangular annulus
• Minimum width color spanning annulus
• Minimum-width rectangular annulus
• On finding a widest empty 1-corner corridor
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• Selecting and covering colored points
• THE LARGEST EMPTY ANNULUS PROBLEM
• Topologically sweeping an arrangement
• Widest empty L-shaped corridor

Cited in

(1)

• Red-blue rectangular annulus cover problem

This page was built for publication: Maximum-width rainbow-bisecting empty annulus

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