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. 

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 10 extracted citations

Optimal Guarding of Polygons and Monotone Chains ( Extended Abstract )

Danny Ziyi Chen, - VladimirEstivill, Castroy, Jorge, UrrutiazAbstractIn
2008
View 1 Excerpt

References

Publications referenced by this paper.

Detecting the weak visibility of a simple polygon and related problems,

Y. Ke
Tech. Report, • 1987
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…