Improved algorithm for the widest empty 1-corner corridor

DOI10.1016/j.ipl.2009.06.014zbMath1202.68449OpenAlexW2068200552MaRDI QIDQ989575

Gautam K. Das, Debapriyay Mukhopadhyay, Subhas C. Nandy

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.06.014

zbMATH Keywords

algorithmcomputational geometrywidest empty 1-corner corridor

Mathematics Subject Classification ID

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

Related Items (1)

Recognition of largest empty orthoconvex polygon in a point set

Cites Work

• Widest empty L-shaped corridor
• On finding a widest empty 1-corner corridor
• The power of geometric duality revisited
• The widest k-dense corridor problems
• Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
• On finding widest empty curved corridors
• Computing obnoxious 1-corner polygonal chains
• The K-dense corridor problems
• Dynamically maintaining the widest \(k\)-dense corridor

This page was built for publication: Improved algorithm for the widest empty 1-corner corridor