Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon

@inproceedings{Das1994OptimalLA,
title={Optimal Linear-Time Algorithm for the Shortest Illuminating Line Segment in a Polygon},
author={Gautam Das and Giri Narasimhan},
booktitle={Symposium on Computational Geometry},
year={1994}
}

Given a simple polygon, we present an optimal linear-time algorithm that computes the <italic>shortest illuminating line segment</italic>, if one exists; else it reports that none exists. This solves an intriguing open problem by improving the <italic>O</italic>(<italic>n</italic>log<italic>n</italic>)-time algorithm for computing such a segment.