论文信息 - A simple linear hidden-line algorithm for star-shaped polygons

A simple linear hidden-line algorithm for star-shaped polygons

A very simple, linear-running-time algorithm is presented for solving the hidden-line problem for star-shaped polygons. The algorithm first decomposes the visibility regions into edge-visible polygons and then solves the hidden-line problem for these simpler polygons. In addition to simplicity the algorithm possesses the virtue of affording a very easy proof of correctness. Some applications where this problem arises are mentioned.

Godfried T. Toussaint | David Rappaport

[1] M. Shamos. Problems in computational geometry , 1975 .

[2] Godfried T. Toussaint,et al. Computational Geometric Problems in Pattern Recognition , 1982 .

[3] Godfried T. Toussaint,et al. SOME NEW RESULTS ON MOVING POLYGONS IN THE PLANE. , 1983 .

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

[5] David Avis,et al. Computing the largest empty convex subset of a set of points , 1985, SCG '85.

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

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

[8] J. Griffiths. Bibliography of hidden - line and hidden - surface algorithms , 1978 .

[9] Herbert Freeman,et al. An Algorithm for the Solution of the Two-Dimensional "Hidden-Line" Problem , 1967, IEEE Trans. Electron. Comput..