Improved algorithm for the widest empty 1-corner corridor

DOI10.1016/J.IPL.2009.06.014zbMATH Open1202.68449OpenAlexW2068200552MaRDI QIDQ989575FDOQ989575

Authors: 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

Recommendations

• Improved Algorithm for a Widest 1-Corner Corridor
• On finding a widest empty 1-corner corridor
• scientific article; zbMATH DE number 1629856
• Dynamically maintaining the widest \(k\)-dense corridor
• scientific article; zbMATH DE number 3883624

zbMATH Keywords

algorithmcomputational geometrywidest empty 1-corner corridor

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (5)

• Recognition of largest empty orthoconvex polygon in a point set
• On finding a widest empty 1-corner corridor
• Dynamically maintaining the widest \(k\)-dense corridor
• On finding widest empty curved corridors
• Improved Algorithm for a Widest 1-Corner Corridor

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

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