The vertex-edge visibility graph of a polygon

Computational Geometry - Tập 10 - Trang 105-120 - 1998
Joseph O'Rourke1, Ileana Streinu1
1Department of Computer Science, Smith College, Northampton, MA 01063, USA

Tài liệu tham khảo

Abello, 1995, Visibility graphs and oriented matroids, 894, 147 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 Everett, 1993, Recovery of convex hulls from external visibility graphs, 309 Ghosh, 1997, On recognizing and characterizing visibility graphs of simple polygons, Discrete Comput. Geom., 17, 143, 10.1007/BF02770871 Ghosh, 1991, An output-sensitive algorithm for computing visibility graphs, SIAM J. Comput., 20, 888, 10.1137/0220055 Goodman, 1984, Semispaces of configurations, cell complexes of arrangements, J. Combin. Theory Ser. A, 37, 257, 10.1016/0097-3165(84)90050-5 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 O'Rourke, 1993, Computational geometry column 18, Internat. J. Comput. Geom. Appl., 3, 107, 10.1142/S0218195993000075 O'Rourke, 1993, Computational geometry column 18, SIGACT News, 24, 20, 10.1145/152992.152994 O'Rourke, 1996, Pseudo-visibility graphs in pseudo-polygons: Part I O'Rourke, 1996, Pseudo-visibility graphs in pseudo-polygons: Part II Pocchiola, 1996, The visibility complex, Internat. J. Comput. Geom. Appl., 6, 279, 10.1142/S0218195996000204