Recent Results in Art Galleries
暂无分享,去创建一个
[1] F. A. Valentine,et al. Some properties of $L$-sets in the plane , 1949 .
[2] William L. Stamey,et al. Unions of two convex sets , 1963 .
[3] David C. Kay,et al. Convexity and a certain propertyPm , 1970 .
[4] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[5] L. Tóth. Illumination of convex discs , 1977 .
[6] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[7] Larry S. Davis,et al. Computational Models of Space: Isovists and Isovist Fields , 1979 .
[8] Tomás Lozano-Pérez,et al. An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.
[9] D. T. Lee,et al. An Optimal Algorithm for Finding the Kernel of a Polygon , 1979, JACM.
[10] D. Kleitman,et al. Covering Regions by Rectangles , 1981 .
[11] Godfried T. Toussaint,et al. An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge , 1981, IEEE Transactions on Computers.
[12] David Avis,et al. A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.
[13] M. Albertson,et al. Covering Regions with Squares , 1981 .
[14] Andrzej Lingas,et al. The Power of Non-Rectilinear Holes , 1982, ICALP.
[15] David Avis,et al. A combinational approach to polygon similarity , 1983, IEEE Trans. Inf. Theory.
[16] Joseph O'Rourke,et al. Galleries need fewer mobile guards: A variation on Chvátal's theorem , 1983 .
[17] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .
[18] Daniel J. Kleitman,et al. An Algorithm for Covering Polygons with Rectangles , 1986, Inf. Control..
[19] Bernard Chazelle,et al. Triangulation and shape-complexity , 1984, TOGS.
[20] J. O'Rourke,et al. Stationing guards in rectilinear art galleries , 1984 .
[21] Anna Lubiw,et al. Decomposing polygonal regions into convex quadrilaterals , 1985, SCG '85.
[22] J. Mark Keil,et al. Decomposing a Polygon into Simpler Components , 1985, SIAM J. Comput..
[23] Hossam Ahmed Elgindy,et al. Hierarchical decomposition of polygons with applications , 1985 .
[24] B. Chazelle,et al. Optimal Convex Decompositions , 1985 .
[25] Stephen K. Wismath,et al. Characterizing bar line-of-sight graphs , 1985, SCG '85.
[26] Simeon C. Ntafos,et al. Optimum watchman routes , 1986, SCG '86.
[27] Roberto Tamassia,et al. A unified approach to visibility representations of planar graphs , 1986, Discret. Comput. Geom..
[28] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[29] A. Lubiw. Orderings and some combinatorial optimization problems with geometric applications , 1986 .
[30] J. Ross Stenstrom,et al. Building wire frames from multiple range views , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.
[31] David M. Mount,et al. An Output Sensitive Algorithm for Computing Visibility Graphs , 1987, FOCS.
[32] Joseph C. Culberson,et al. Covering a simple orthogonal polygon with a minimum number of orthogonally convex polygons , 1987, SCG '87.
[33] John Hershberger,et al. Finding the visibility graph of a simple polygon in time proportional to its size , 1987, SCG '87.
[34] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[35] Michael McKenna. Worst-case optimal hidden-surface removal , 1987, TOGS.
[36] Willem F. Bronsvoort,et al. Boundary evaluation and direct display of CSG models , 1988 .
[37] Joseph C. Culberson,et al. Covering polygons is hard , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[38] Godfried T. Toussaint,et al. Guard Placement in Rectilinear Polygons , 1988 .
[39] Subir Kumar Ghosh. On Recognizing and Characterizing Visibility Graphs of Simple Polygons , 1988, SWAT.
[40] Joseph S. B. Mitchell,et al. An Algorithmic Approach to Some Problems in Terrain Navigation , 1988, Artif. Intell..
[41] S. N. Maheshwari,et al. Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles , 1988, SCG '88.
[42] Marilyn Breen. Characterizing compact unions of two starshaped sets inRd , 1989 .
[43] Jimmy J. M. Tan,et al. Minimum partitioning simple rectilinear polygons in O(n log log n) - time , 1989, SCG '89.
[44] Hans-Dietrich Hecker,et al. Some NP-hard Polygon Cover Problems , 1989, J. Inf. Process. Cybern..
[45] G. G. Roy,et al. SR: a PC-based CAD system for shadow and reflection studies in the built environment , 1989 .
[46] Chong-Min Kyung,et al. Hybrid shadow testing scheme for ray tracing , 1989 .
[47] Rajeev Motwani,et al. Perfect Graphs and Orthogonally Convex Covers , 1989, SIAM J. Discret. Math..
[48] Frank Hoffmann,et al. On the Rectilinear Art Gallery Problem (Extended Abstract) , 1990, ICALP.
[49] Derek G. Corneil,et al. Visibility graph recognition , 1990 .
[50] Yan Ke. Polygon visibility algorithms for weak visibility and link distance problems , 1990 .
[51] Hazel Everett,et al. Recognizing Visibility Graphs of Spiral Polygons , 1990, J. Algorithms.
[52] Subhash Suri,et al. An Optimal Algorithm for Detecting Weak Visibility of a Polygon , 1990, IEEE Trans. Computers.
[53] Simeon C. Ntafos. The Robber Route Problem , 1990, Inf. Process. Lett..
[54] Bernard Chazelle,et al. Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[55] Hazel Everett,et al. The Aquarium Keeper's Problem , 1991, SODA '91.
[56] Collette R. Coullard,et al. Distance visibility graphs , 1991, SCG '91.
[57] Rolf Klein,et al. The two guards problem , 1991, SCG '91.
[58] Thomas C. Shermer,et al. Covering and guarding polygons using Lk-sets , 1991 .
[59] Thomas C. Shermer. On recognizing unions of two convex polygons and related problems , 1993, Pattern Recognit. Lett..
[60] William J. Lenhart,et al. An art gallery theorem for line segments in the plane , 1993, Pattern Recognit. Lett..