Characterizing and recognizing weak visibility polygons

Avis, 1983, A combinatorial approach to polygon similarity, IEEE Trans. Inform. Theory, 29, 148, 10.1109/TIT.1983.1056600 Avis, 1981, An optimal algorithm for determining the visibility of a polygon from an edge, IEEE Trans. Comput., 30, 910, 10.1109/TC.1981.1675729 Bronsvoort, 1988, Boundary evaluation and direct display of CSG models, Computer-Aided Design, 20, 416, 10.1016/0010-4485(88)90218-7 Chazelle, 1984, Triangulation and shape-complexity, ACM Trans. Graph., 3, 135, 10.1145/357337.357340 David, 1979, Computational Models of space: isovists and isovist fields, Comput. Graph. Image Process., 11, 49, 10.1016/0146-664X(79)90076-5 Eo, 1989, Hybrid shadow testing scheme for any tracing, Computer-Aided Design, 21, 38, 10.1016/0010-4485(89)90115-2 Everett, 1989, Visibility graph recognition Ghosh, 1991, Computing the visibility polygon from a convex set and related problems, J. Algorithms, 12, 75, 10.1016/0196-6774(91)90024-S Ghosh, 1991, Lecture Notes in Comput. Sci., Vol. 560, 369 Ghosh, 1990, An algorithm for recognizing palm polygons, Proceedings of the Second Canadian Conference in Computational Geometry, 246 Guibas, 1987, Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, 2, 209, 10.1007/BF01840360 Hershberger, 1989, An optimal visibility graph algorithm for triangulated simple polygons, Algorithmica, 4, 141, 10.1007/BF01553883 Ke, 1988, Detecting the weak visibility of a simple polygon and related problems Kuc, 1987, Efficient representation of reflecting structures for a sonar navigation model, Proceeding of IEEE International Conference on Robotics and Automation, 1916 Lozano-Perez, 1979, An optimal for planning collision-free paths among polyhedral obstacles, Communications of the ACM, 22, 560, 10.1145/359156.359164 McKenna, 1987, Worst-case optimal hidden-surface removals, ACM Trans. Graph., 6, 19, 10.1145/27625.27627 Mitchell, 1988, An algorithmic approach to some problems in terrain navigation Sack, 1988, An optimal algorithm for detecting weak visibility of a polygon, Proceedings of the 5th Symposium on Theoretical Aspects of Computer Science, 312 Pal, 1990, Weak visibility and related problems on simple polygons Roy, 1989, SR: a PC-based CAD system for shadow and reflection studies in the built environment, Computer-Aided Design, 21, 497, 10.1016/0010-4485(89)90057-2 Shermer, 1989, Hiding people in polygons, Computing, 42, 109, 10.1007/BF02239742 Shin, 1989, An optimal algorithm for finding all visible edges in a simple polygon, IEEE Trans. Robot. and Automat., 5, 202, 10.1109/70.88040 Stenstrom, 1988, Building wire frames for multiple range views, Proceedings of IEEE International Conference on Robotics and Automation, 615 Toussaint, 1980, Pattern recognition and geometric complexity, Proceedings of the 5th International Conference on Pattern Recognition, 1324 Toussaint, 1986, Shortest path solves edge-to-edge visibility in a polygon, Pattern Recognition Lett., 4, 165, 10.1016/0167-8655(86)90015-2 Xie, 1986, Planning views for the incremental construction of body models, Proceedings of the International Conference on Pattern Recognition, 154 Yachida, 1986, 3-D data acquisition my multiple views, 11