Shortest path solves edge-to-edge visibility in a polygon
暂无分享,去创建一个
[1] David Avis,et al. A combinational approach to polygon similarity , 1983, IEEE Trans. Inf. Theory.
[2] Bernard Chazelle,et al. Detection is easier than computation (Extended Abstract) , 1980, STOC '80.
[3] Hossam Ahmed Elgindy,et al. Hierarchical decomposition of polygons with applications , 1985 .
[4] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[5] Leonidas J. Guibas,et al. Visibility and intersectin problems in plane geometry , 1985, SCG '85.
[6] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[7] Herbert Freeman,et al. An Algorithm for the Solution of the Two-Dimensional "Hidden-Line" Problem , 1967, IEEE Trans. Electron. Comput..
[8] D. T. Lee,et al. Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..
[9] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[10] Joseph O'Rourke,et al. Worst-case optimal algorithms for constructing visibility polygons with holes , 1986, SCG '86.
[11] D. T. Lee,et al. Computing the visibility polygon from an edge , 1986, Comput. Vis. Graph. Image Process..
[12] Nils J. Nilsson,et al. A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.
[13] Robert E. Tarjan,et al. Triangulating a Simple Polygon , 1978, Inf. Process. Lett..
[14] G. Toussaint. Solving geometric problems with the rotating calipers , 1983 .
[15] Robert M. Haralick,et al. Decomposition of Two-Dimensional Shapes by Graph-Theoretic Clustering , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[16] Larry S. Davis,et al. Computational Models of Space: Isovists and Isovist Fields , 1979 .
[17] T. Asano. An Efficient Algorithm for Finding the Visibility Polygon for a Polygonal Region with Holes , 1985 .
[18] Bernard Chazelle,et al. A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[19] Hans Rohnert,et al. Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..
[20] Godfried T. Toussaint. Shortest Path Solves Translation Separability of Polygons , 1986, IAS.
[21] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.
[22] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.
[23] Christian Lantuéjoul,et al. Geodesic methods in quantitative image analysis , 1984, Pattern Recognit..