Corrections to Lee's visibility polygon algorithm
- 342 Downloads
We present a modification and extension of the (linear time) visibility polygon algorithm of Lee. The algorithm computes the visibility polygon of a simple polygon from a viewpoint that is either interior to the polygon, or in its blocked exterior (the cases of viewpoints on the boundary or in the free exterior being simple extensions of the interior case). We show by example that the original algorithm by Lee, and a more complex algorithm by El Gindy and Avis, can fail for polygons that wind sufficiently. We present a second version of the algorithm, which does not extend to the blocked exterior case.
Keywordscomputational geometry visibility
Unable to display preview. Download preview PDF.
- 2.H. Freeman and P. P. Loutrel:An algorithm for the solution of the two-dimensional hidden-line problem, IEEE Trans. on Electronic Computers, EC-16, (1967), pp. 784–790.Google Scholar
- 3.P. Henrici:Applied and Computational Complex Analysis, Vol. 1, John Wiley & Sons, (1974).Google Scholar
- 4.B. Joe and R. B. Simpson:Visibility of a simple polygon from a point, Technical Report CS-85-38. Dept. of Computer Science, Univ. of Waterloo, (1985).Google Scholar
- 5.B. Joe and R. B. Simpson:Triangular meshes for regions of complicated shape, Int. J. for Num. Meth. in Eng., 23 (1986), pp. 751–778.Google Scholar
- 6.B. Joe and R. B. Simpson:Algorithms and correctness proofs for visibility polygon computations, Technical Report CS-87-03, Dept. of Computer Science, Univ. of Waterloo, (1987).Google Scholar
- 7.D. T. Lee:Visibility of a simple polygon, Computer Vision, Graphics, and Image Processing, 22 (1983), pp. 207–221.Google Scholar
- 8.B. Schachter:Decomposition of polygons into convex sets, IEEE Trans. on Comp., C-27, (1978), pp. 1078–1082.Google Scholar