Optimal linear-time algorithm for the shortest illuminating line segment in a polygon

Authors:
Gautam Das;Giri Narasimhan
Affiliations:
Math Sciences Dept., Memphis State University, Memphis, TN;Math Sciences Dept., Memphis State University, Memphis, TN
Venue:
SCG '94 Proceedings of the tenth annual symposium on Computational geometry
Year:
1994

Citing 9
Cited 3

Planar point location using persistent search trees

Communications of the ACM
Shortest watchman routes in simple polygons

Discrete & Computational Geometry
An Optimal Algorithm for Detecting Weak Visibility of a Polygon

IEEE Transactions on Computers
Triangulating a simple polygon in linear time

Discrete & Computational Geometry
Computational geometry column 18

ACM SIGACT News
An algorithm for determining visibility of a simple polygon from an internal line segment

Journal of Algorithms
Watchman routes under limited visibility

Computational Geometry: Theory and Applications
An optimal algorithm for the two-guard problem

SCG '93 Proceedings of the ninth annual symposium on Computational geometry
An Optimal Algorithm for Finding the Kernel of a Polygon

Journal of the ACM (JACM)

Finding the shortest boundary guard of a simple polygon

Theoretical Computer Science
Optimally computing a shortest weakly visible line segment inside a simple polygon

Computational Geometry: Theory and Applications
Finding all weakly-visible chords of a polygon in linear time

Nordic Journal of Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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