Issue No. 10 - October (1990 vol. 39)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.59852
<p>Notation and a theorem are presented which, using a result of B. Chazelle and L.J. Guibas (1985), enable the authors to design an O(n log n) algorithm for reporting all visibility edges of a given n-vertex polygon. Improving on this bound to O(n) is presently focused upon. This problem is solved for polygons with at least one given visibility edge. It is assumed that both endpoints of this edge are convex vertices. Subsequently, it is shown how to drop this restriction. The general case of detecting weak edge visibility of an arbitrary simple polygon is dealt with.</p>
visibility detection; optimal algorithm; visibility edges; n-vertex polygon; endpoints; convex vertices; weak edge visibility; computational complexity; computational geometry.
S. Suri and J. Sack, "An Optimal Algorithm for Detecting Weak Visibility of a Polygon," in IEEE Transactions on Computers, vol. 39, no. , pp. 1213-1219, 1990.