An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge
暂无分享,去创建一个
[1] Herbert Freeman,et al. An Algorithm for the Solution of the Two-Dimensional "Hidden-Line" Problem , 1967, IEEE Trans. Electron. Comput..
[2] F. A. Valentine. MINIMAL SETS OF VISIBILITY , 1953 .
[3] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.
[4] Larry S. Davis,et al. Computational Models of Space: Isovists and Isovist Fields , 1979 .
[5] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[6] Nils J. Nilsson,et al. A Mobile Automaton: An Application of Artificial Intelligence Techniques , 1969, IJCAI.
[7] Nils J. Nilsson,et al. A mobius automation: an application of artificial intelligence techniques , 1969, IJCAI 1969.
[8] Godfried T. Toussaint,et al. PATTERN RECOGNITION AND GEOMETRICAL COMPLEXITY. , 1980 .
[9] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .