The K-dense corridor problems

DOI10.1016/0167-8655(90)90080-LMaRDI QIDQ4310578zbMATH OpenOpenAlexFDO

Authors

Publication date 1 August 2000

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(90)90080-l

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cited in

(12)

• The widest k-dense corridor problems
• Locating an obnoxious plane
• Improved Algorithm for a Widest 1-Corner Corridor
• SMALLEST COLOR-SPANNING OBJECT REVISITED
• THE LARGEST EMPTY ANNULUS PROBLEM
• Locating an obnoxious line among planar objects
• Dynamically maintaining the widest k-dense corridor
• Minimum-width double-slabs and widest empty slabs in high dimensions
• Widest empty L-shaped corridor
• On k-enclosing slab problems
• Minimum-width double-slabs and widest empty slabs in high dimensions
• Improved algorithm for the widest empty 1-corner corridor

This page was built for publication: The K-dense corridor problems

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