@inproceedings{253f229ae00e40189a467e089acd5bc9,

title = "A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible",

abstract = "A simple polygon P is said to be weakly externally visible from a line segment if the line segment is outside P and if for every point x on the boundary of P there is a point y on the line segment such that the interior of the line segment xy does not intersect the interior of P. In this paper a linear time algorithm is proposed for computing the shortest line segment from which a simple polygon is weakly externally visible. This is done by a suitable generalization of a linear time algorithm which solves the same problem for a convex polygon.",

author = "Bhattacharya, {Binary K.} and Asish Mukhopadhyay and Toussaint, {Godfried T.}",

year = "1991",

doi = "10.1007/BFb0028280",

language = "English (US)",

isbn = "9783540475668",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "412--424",

editor = "Frank Dehne and Jorg-Rudiger Sack and Nicola Santoro",

booktitle = "Algorithms and Data Structures - 2nd Workshop, WADS 1991, Proceedings",

note = "2nd Workshop on Algorithms and Data Structures, WADS 1991 ; Conference date: 14-08-1991 Through 16-08-1991",

}