Improved Bounds for Wireless Localization
暂无分享,去创建一个
Michael Hoffmann | Yoshio Okamoto | Takeaki Uno | Tobias Christ | M. Hoffmann | T. Uno | Y. Okamoto | Tobias Christ
[1] Leonidas J. Guibas,et al. An efficient algorithm for finding the CSG representation of a simple polygon , 1988, Algorithmica.
[2] Bettina Speckmann,et al. Allocating Vertex π-Guards in Simple Polygons via Pseudo-Triangulations , 2003, SODA '03.
[3] Gert Vegter,et al. In handbook of discrete and computational geometry , 1997 .
[4] Steve Fisk,et al. A short proof of Chvátal's Watchman Theorem , 1978, J. Comb. Theory, Ser. B.
[5] Joseph O'Rourke,et al. Computational geometry column 48 , 2006, SIGA.
[6] Joseph O'Rourke,et al. A New Lower Bound on Guard Placement for Wireless Localization , 2007, ArXiv.
[7] Leonidas J. Guibas,et al. Compact interval trees: a data structure for convex hulls , 1991, SODA '90.
[8] D. T. Lee,et al. Computational complexity of art gallery problems , 1986, IEEE Trans. Inf. Theory.
[9] T. Shermer. Recent Results in Art Galleries , 1992 .
[10] Martin Aigner,et al. Proofs from THE BOOK , 1998 .
[11] V. Chvátal. A combinatorial theorem in plane geometry , 1975 .
[12] Joseph O'Rourke,et al. Galleries need fewer mobile guards: A variation on Chvátal's theorem , 1983 .
[13] Menelaos I. Karavelas. Guarding curvilinear art galleries with edge or mobile guards , 2008, SPM '08.
[14] Csaba D. Tóth,et al. Guarding curvilinear art galleries with vertex or point guards , 2009, Comput. Geom..
[15] J. Kahn,et al. Traditional Galleries Require Fewer Watchmen , 1983 .
[16] David Eppstein,et al. Guard placement for efficient point-in-polygon proofs , 2007, SCG '07.
[17] Euripides Markou,et al. Maximizing the guarded boundary of an Art Gallery is APX-complete , 2003, Comput. Geom..
[18] Jorge Urrutia,et al. Art Gallery and Illumination Problems , 2000, Handbook of Computational Geometry.