Improved Algorithm for a Widest 1-Corner Corridor

DOI10.1007/978-3-642-00202-1_8MaRDI QIDQ3605487zbMATHOpenAlexFDO

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

Publication date 24 February 2009

Published in WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00202-1_8

Mathematics Subject Classification ID

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

Recommendations

• Improved algorithm for the widest empty 1-corner corridor
• On finding a widest empty 1-corner corridor
• scientific article; zbMATH DE number 1629856
• Dynamically maintaining the widest \(k\)-dense corridor
• Computing the width of a set

Cites work

• Computing obnoxious 1-corner polygonal chains
• Dynamically maintaining the widest \(k\)-dense corridor
• On finding a widest empty 1-corner corridor
• The K-dense corridor problems
• 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
• Widest empty L-shaped corridor

Cited in

(4)

• Improved algorithm for the widest empty 1-corner corridor
• Dynamically maintaining the widest \(k\)-dense corridor
• On finding a widest empty 1-corner corridor
• On finding widest empty curved corridors

This page was built for publication: Improved Algorithm for a Widest 1-Corner Corridor

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