On finding a widest empty 1-corner corridor

DOI10.1016/J.IPL.2006.02.002MaRDI QIDQ844199zbMATHOpenAlexFDO

Authors Mario A. Lopez, J. M. Díaz-Báñez, J. Antoni Sellarès

Publication date 18 January 2010

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

Full work available at URL https://idus.us.es/xmlui/handle/11441/55064

zbMATH Keywords

algorithmscomputational geometrywidest empty corridors

Mathematics Subject Classification ID

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

Recommendations

• Improved algorithm for the widest empty 1-corner corridor
• Improved Algorithm for a Widest 1-Corner Corridor
• On finding widest empty curved corridors
• Largest empty rectangle among a point set
• Dynamically maintaining the widest \(k\)-dense corridor

Cites work

• Computing largest empty circles with location constraints
• Computing obnoxious 1-corner polygonal chains
• On finding an empty staircase polygon of largest area (width) in a planar point-set
• On the maximum empty rectangle problem
• Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
• THE LARGEST EMPTY ANNULUS PROBLEM
• Widest empty L-shaped corridor

Cited in

(7)

• Maximum-width empty square and rectangular annulus
• Maximum-width rainbow-bisecting empty annulus
• Improved Algorithm for a Widest 1-Corner Corridor
• Improved algorithm for the widest empty 1-corner corridor
• Between Broadway and the Hudson: A Bijection of Corridor Paths
• Dynamically maintaining the widest \(k\)-dense corridor
• On finding widest empty curved corridors

This page was built for publication: On finding a widest empty 1-corner corridor

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