Visibility between two edges of a simple polygon

This publication has 29 references indexed in Scilit:

• A simple linear hidden-line algorithm for star-shaped polygons
  Pattern Recognition Letters, 1985
• Separation of two monotone polygons in linear time
  Robotica, 1984
• Euclidean shortest paths in the presence of rectilinear barriers
  Networks, 1984
• Visibility of a simple polygon
  Computer Vision, Graphics, and Image Processing, 1983
• A combinational approach to polygon similarity
  IEEE Transactions on Information Theory, 1983
• Hysterical B-trees
  Information Processing Letters, 1981
• An algorithm for planning collision-free paths among polyhedral obstacles
  Communications of the ACM, 1979
• Computational models of space: Isovists and isovist fields
  Computer Graphics and Image Processing, 1979
• An Optimal Algorithm for Finding the Kernel of a Polygon
  Journal of the ACM, 1979
• Bibliography of hidden - line and hidden - surface algorithms
  Computer-Aided Design, 1978