暂无分享,去创建一个
[1] Anne-Marie Kermarrec,et al. Greedy geographic routing in large-scale sensor networks: a minimum network decomposition approach , 2012, TNET.
[2] Andrew Chi-Chih Yao,et al. A Lower Bound to Finding Convex Hulls , 1981, JACM.
[3] Ivan Stojmenovic,et al. Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.
[4] Brad Karp,et al. GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.
[5] Leonidas J. Guibas,et al. Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons , 1987, Algorithmica.
[6] Kai Salomaa,et al. Routing in a Polygonal Terrain with the Shortest Beacon Watchtower , 2014, CCCG.
[7] Sang Won Bae,et al. Tight Bounds for Beacon-Based Coverage in Simple Rectilinear Polygons , 2016, LATIN.
[8] Kai Salomaa,et al. On the Inverse Beacon Attraction Region of a Point , 2015, CCCG.
[9] Joseph S. B. Mitchell,et al. Beacon-Based Algorithms for Geometric Routing , 2013, WADS.
[10] Jie Gao,et al. Combinatorics of beacon-based routing and coverage , 2013 .
[11] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.
[12] Michael Biro. Beacon-based routing and guarding , 2013 .
[13] G.S. Brodal,et al. Dynamic planar convex hull , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[14] Leonidas J. Guibas,et al. Visibility and intersection problems in plane geometry , 1989, Discret. Comput. Geom..
[15] Thomas C. Shermer. A Combinatorial Bound for Beacon-based Routing in Orthogonal Polygons , 2015, CCCG.
[16] Kai Salomaa,et al. The Length of the Beacon Attraction Trajectory , 2016, CCCG.