This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
December 1981 (vol. 30 no. 12)
pp. 910-914
D. Avis, School of Computer Science, McGill University
In many computer applications areas such as graphics, automated cartography, image processing, and robotics the notion of visibility among objects modeled as polygons is a recurring theme. This paper is concerned with the visibility of a simple polygon from one of its edges. Three natural definitions of the visibility of a polygon from an edge are presented. The following computational problem is considered. Given an n-sided simple polygon, is the polygon visible from a specified edge? An O(n), and thus optimal, algorithm is exhibited for determining edge visibility under any of the three definitions. The paper closes with an interesting characterization of visibility and some open problems in this area.
Index Terms:
visibility, Algorithms, computational complexity, computational geometry, computer graphics, hidden line problems, image processing, robotics, simple polygon
Citation:
D. Avis, G.T. Toussaint, "An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge," IEEE Transactions on Computers, vol. 30, no. 12, pp. 910-914, Dec. 1981, doi:10.1109/TC.1981.1675729
Usage of this product signifies your acceptance of the Terms of Use.