论文信息 - An Optimal Algorithm for Detecting Weak Visibility of a Polygon

An Optimal Algorithm for Detecting Weak Visibility of a Polygon

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. >

Subhash Suri | Jörg-Rüdiger Sack

[1] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[2] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.

[3] Subhash Suri,et al. On some link distance problems in a simple polygon , 1990, IEEE Trans. Robotics Autom..

[4] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.

[5] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.

[6] Godfried T. Toussaint,et al. On a convex hull algorithm for polygons and its application to triangulation problems , 1982, Pattern Recognit..

[7] Robert E. Tarjan,et al. An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[8] Godfried T. Toussaint,et al. Translating Polygons in the Plane , 1985, STACS.

[9] D. T. Lee,et al. Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..