Widest empty L-shaped corridor

DOI10.1016/0020-0190(96)00070-1MaRDI QIDQ671259zbMATH OpenOpenAlexFDO

Authors Siu-Wing Cheng

Publication date 27 February 1997

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

Full work available at URL https://doi.org/10.1016/0020-0190(96)00070-1

zbMATH Keywords

AlgorithmsComputational geometryPersistent search tree

Mathematics Subject Classification ID

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

Cites work

• The K-dense corridor problems

Cited in

(12)

• On finding an empty staircase polygon of largest area (width) in a planar point-set
• On finding widest empty curved corridors
• Locating an obnoxious plane
• Computing obnoxious 1-corner polygonal chains
• Improved Algorithm for a Widest 1-Corner Corridor
• Recognition of largest empty orthoconvex polygon in a point set
• THE LARGEST EMPTY ANNULUS PROBLEM
• Locating an obnoxious line among planar objects
• Maximum-width empty square and rectangular annulus
• Maximum-width rainbow-bisecting empty annulus
• On finding a widest empty 1-corner corridor
• Improved algorithm for the widest empty 1-corner corridor

This page was built for publication: Widest empty L-shaped corridor

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