Loading...
Please wait, while we are loading the content...
Optimally Computing a Shortest Weakly Visible Line Segment Inside a Simple Polygon (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Bhattacharya, Binay K. Das, Gautam Mukhopadhyay, Asish Narasimhan, Giri |
| Abstract | A simple polygon is said to be weakly internally visible from a line segment lying inside it if every point on the boundary of the polygon is visible from some point on the line segment. In this paper, we present an optimal linear-time algorithm for the following problem: Given a simple polygon, either compute a shortest line segment from which the polygon is weakly internally visible, or report that the polygon is not weakly internally visible. |
| File Format | |
| Volume Number | 23 |
| Journal | Computational Geometry: Theory and Applications |
| Language | English |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Simple Polygon Shortest Weakly Visible Line Segment Line Segment Optimal Linear-time Algorithm Following Problem Shortest Line Segment |
| Content Type | Text |
| Resource Type | Article |
