Binay K. Bhattacharya, Asish Mukhopadhyay, Godfried T. Toussaint. A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible. In Frank K. H. A. Dehne, Jörg-Rüdiger Sack, Nicola Santoro, editors, Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings. Volume 519 of Lecture Notes in Computer Science, pages 412-424, Springer, 1991.
@inproceedings{BhattacharyaMT91,
title = {A Linear Time Algorithm for Computing the Shortest Line Segment from Which a Polygon is Weakly Externally Visible},
author = {Binay K. Bhattacharya and Asish Mukhopadhyay and Godfried T. Toussaint},
year = {1991},
researchr = {https://researchr.org/publication/BhattacharyaMT91},
cites = {0},
citedby = {0},
pages = {412-424},
booktitle = {Algorithms and Data Structures, 2nd Workshop WADS 91, Ottawa, Canada, August 14-16, 1991, Proceedings},
editor = {Frank K. H. A. Dehne and Jörg-Rüdiger Sack and Nicola Santoro},
volume = {519},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {3-540-54343-0},
}