The K-dense corridor problems

DOI10.1016/0167-8655(90)90080-LzbMath0941.68725OpenAlexW2059858725MaRDI QIDQ4310578

No author found.

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)

Related Items (9)

LOCATING AN OBNOXIOUS LINE AMONG PLANAR OBJECTS ⋮ THE LARGEST EMPTY ANNULUS PROBLEM ⋮ Widest empty L-shaped corridor ⋮ Dynamically maintaining the widest \(k\)-dense corridor ⋮ Locating an obnoxious plane ⋮ Improved algorithm for the widest empty 1-corner corridor ⋮ Improved Algorithm for a Widest 1-Corner Corridor ⋮ The widest k-dense corridor problems ⋮ SMALLEST COLOR-SPANNING OBJECT REVISITED

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