论文信息 - Reprint of: Theta-3 is connected

Reprint of: Theta-3 is connected

In this paper, we show that the ?-graph with three cones is connected. We also provide an alternative proof of the connectivity of the Yao graph with three cones.

[1] J. Mark Keil,et al. Approximating the Complete Euclidean Graph , 1988, Scandinavian Workshop on Algorithm Theory.

[2] Kenneth L. Clarkson,et al. Approximation algorithms for shortest path motion planning , 1987, STOC.

[3] Prosenjit Bose,et al. The θ5-graph is a spanner , 2015, Comput. Geom..

[4] Nicolas Bonichon,et al. Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces , 2010, WG.

[5] Prosenjit Bose,et al. Optimal Bounds on Theta-Graphs: More is not Always Better , 2012, CCCG.

[6] El Molla,et al. Yao spanners for wireless ad hoc networks , 2009 .

[7] Prosenjit Bose,et al. On the Stretch Factor of the Theta-4 Graph , 2013, WADS.

[8] Sang Won Bae,et al. Theta-3 is connected , 2014, CCCG.

[9] Prosenjit Bose,et al. On the Spanning Ratio of Theta-Graphs , 2013, WADS.

[10] Giri Narasimhan,et al. Geometric spanner networks , 2007 .

[11] Mirela Damian,et al. Undirected connectivity of sparse Yao graphs , 2011, FOMC '11.