Point guards and point clouds: solving general art gallery problems
暂无分享,去创建一个
Cid C. de Souza | Pedro Jussieu de Rezende | Sándor P. Fekete | Stephan Friedrichs | Alexander Kröller | Christiane Schmidt | Andreas Nüchter | Dorit Borrmann | Davi C. Tozoni | D. Borrmann | A. Nüchter | S. Fekete | Christiane Schmidt | A. Kröller | P. J. Rezende | Stephan Friedrichs | C. C. Souza
[1] Sándor P. Fekete,et al. Exact solutions and bounds for general art gallery problems , 2010, JEAL.
[2] Cid C. de Souza,et al. An Exact and Efficient Algorithm for the Orthogonal Art Gallery Problem , 2007, XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007).
[3] J. O'Rourke. Art gallery theorems and algorithms , 1987 .
[4] Cid C. de Souza,et al. The Quest for Optimal Solutions for the Art Gallery Problem: A Practical Iterative Algorithm , 2013, SEA.
[5] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[6] Stephan Eidenbenz,et al. Inapproximability Results for Guarding Polygons and Terrains , 2001, Algorithmica.
[7] Sándor P. Fekete,et al. Facets for Art Gallery Problems , 2013, Algorithmica.
[8] Joachim Hertzberg,et al. Globally consistent 3D mapping with scan matching , 2008, Robotics Auton. Syst..
[9] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[10] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .