Improved algorithm for the widest empty 1-corner corridor
type: Item
instance of: scholarly article
title: Improved algorithm for the widest empty 1-corner corridor
zbMATH Open document ID: 1202.68449
author: Gautam K. Das
author: Debapriyay Mukhopadhyay
author: Subhas C. Nandy
published in: Information Processing Letters
publication date: 2010-08-20T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 5773853
zbMATH Keywords: widest empty 1-corner corridor
zbMATH Keywords: algorithm
zbMATH Keywords: computational geometry
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.06.014
OpenAlex ID: W2068200552
cites work: On finding widest empty curved corridors
cites work: Widest empty L-shaped corridor
cites work: The K-dense corridor problems
cites work: Computing obnoxious 1-corner polygonal chains
cites work: On finding a widest empty 1-corner corridor
cites work: Triangular range counting query in 2D and its application in finding \(k\) nearest neighbors of a line segment
cites work: The power of geometric duality revisited
cites work: Dynamically maintaining the widest \(k\)-dense corridor
cites work: The widest k-dense corridor problems
DOI: 10.1016/J.IPL.2009.06.014
description: scientific article; zbMATH DE number 5773853