Maximum-width rainbow-bisecting empty annulus

DOI10.1016/j.comgeo.2024.102088MaRDI QIDQ6551277

Sandip Banerjee, Sang Won Bae, Priya Ranjan Sinha Mahapatra, Arpita Baral, 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)

Cites Work

• Unnamed Item
• Unnamed Item
• Minimum-width rectangular annulus
• Widest empty L-shaped corridor
• On finding a widest empty 1-corner corridor
• Topologically sweeping an arrangement
• Minimum width color spanning annulus
• Selecting and covering colored points
• Color spanning objects: algorithms and hardness results
• Locating an obnoxious plane
• Computing the Smallest Color-Spanning Axis-Parallel Square
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• THE LARGEST EMPTY ANNULUS PROBLEM
• Maximum-width empty square and rectangular annulus

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