Energy-Aware Stage Illumination
暂无分享,去创建一个
[1] Csaba D. Tóth. Art gallery problem with guards whose range of vision is 180 , 2000, Comput. Geom..
[2] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[3] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .
[4] David Eppstein,et al. The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..
[5] Christos H. Papadimitriou,et al. An Algorithm for Shortest-Path Motion in Three Dimensions , 1985, Inf. Process. Lett..
[6] Géza Tóth,et al. Ote on an Art Gallery Problem , 1998, Comput. Geom..
[7] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.
[8] R. Gregory Taylor,et al. Modern computer algebra , 2002, SIGA.
[9] Stephan Eidenbenz,et al. Approximation algorithms for terrain guarding , 2002, Inf. Process. Lett..
[10] Bettina Speckmann,et al. Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations , 2003, SODA '03.
[11] Jorge Urrutia,et al. Optimal floodlight illumination of stages , 1998, SCG '98.
[12] Jörg-Rüdiger Sack,et al. Approximation algorithms for geometric shortest path problems , 2000, STOC '00.