On finding a widest empty 1-corner corridor

DOI10.1016/j.ipl.2006.02.002zbMath1187.68637OpenAlexW2136494960MaRDI QIDQ844199

Mario A. Lopez, J. Antoni Sellarès, José-Miguel Díaz-Báñez

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)

Related Items (4)

On finding widest empty curved corridors ⋮ Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ Maximum-width empty square and rectangular annulus

Cites Work

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

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