Shortest path solves edge-to-edge visibility in a polygon

This publication has 12 references indexed in Scilit:

• Euclidean shortest paths in the presence of rectilinear barriers
  Networks, 1984
• Geodesic methods in quantitative image analysis
  Pattern Recognition, 1984
• Applications of a two-dimensional hidden-line algorithm to other geometric problems
  Computing, 1983
• Visibility of a simple polygon
  Computer Vision, Graphics, and Image Processing, 1983
• A combinational approach to polygon similarity
  IEEE Transactions on Information Theory, 1983
• A linear algorithm for computing the visibility polygon from a point
  Journal of Algorithms, 1981
• 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
• Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1979
• An Algorithm for the Solution of the Two-Dimensional ``Hidden-Line'' Problem
  IEEE Transactions on Electronic Computers, 1967