Widest empty L-shaped corridor

Information Processing Letters

Volumn 58, Issue 6, 1996, Pages 277-283

  Cheng, Siu Wing ^a  

^a HONG KONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Hong Kong)

Author keywords

Algorithms; Computational geometry; Persistent search tree

Indexed keywords

EID: 0042953282     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00070-1     Document Type: Article

References (5)

1. S. Chattopadhyay and P. Das, The k-dense corridor problems, Pattern Recognition Lett. 11 (1990) 463-469.
2. S.W. Cheng, Widest empty corridor with multiple links and right-angle turns, in: Proc. 6th Canadian Conf. on Computational Geometry (1994) 57-62.
3. M. Houle and A. Maciel, Finding the widest empty corridor through a set of points, Tech Rept. TR SOCS-88.11, Dept. of Computer Science, McGill University, Montreal, Canada, 1988.
4. R. Janardan and F. Preparata, Widest-corridor problems, Tech. Rept. TR 93-17, Dept. of Computer Science, University of Minnesota (Twin Cities), 1993; also in: Proc. 5th Canadian Conf. on Computational Geometry (1993) 426-431.
5. N. Sarnak and R. Tarjan, Planar point location using persistent search trees, Comm. ACM 29 (1986) 669-679.