Advertisement

The Price of Order

  • Prosenjit Bose
  • Pat Morin
  • André van RenssenEmail author
Conference paper
  • 1.1k Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8889)

Abstract

We present tight bounds on the spanning ratio of a large family of ordered \(\theta \)-graphs. A \(\theta \)-graph partitions the plane around each vertex into \(m\) disjoint cones, each having aperture \(\theta = 2 \pi /m\). An ordered \(\theta \)-graph is constructed by inserting the vertices one by one and connecting each vertex to the closest previously-inserted vertex in each cone. We show that for any integer \(k \ge 1\), ordered \(\theta \)-graphs with \(4k + 4\) cones have a tight spanning ratio of \(1 + 2 \sin (\theta /2) / (\cos (\theta /2) - \sin (\theta /2))\). We also show that for any integer \(k \ge 2\), ordered \(\theta \)-graphs with \(4k + 2\) cones have a tight spanning ratio of \(1 / (1 - 2 \sin (\theta /2))\). We provide lower bounds for ordered \(\theta \)-graphs with \(4k + 3\) and \(4k + 5\) cones. For ordered \(\theta \)-graphs with \(4k + 2\) and \(4k + 5\) cones these lower bounds are strictly greater than the worst case spanning ratios of their unordered counterparts. These are the first results showing that ordered \(\theta \)-graphs have worse spanning ratios than unordered \(\theta \)-graphs. Finally, we show that, unlike their unordered counterparts, the ordered \(\theta \)-graphs with 4, 5, and 6 cones are not spanners.

Keywords

Induction Hypothesis Left Corner Delaunay Triangulation Tight Bound Inductive Proof 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Aichholzer, O., Bae, S.W., Barba, L., Bose, P., Korman, M., van Renssen, A., Taslakian, P., Verdonschot, S.: Theta-3 is connected. In: CCCG, pp. 205–210 (2013)Google Scholar
  2. 2.
    Barba, L., Bose, P., De Carufel, J.-L., van Renssen, A., Verdonschot, S.: On the stretch factor of the theta-4 graph. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 109–120. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: Thilikos, D.M. (ed.) WG 2010. LNCS, vol. 6410, pp. 266–278. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  4. 4.
    Bose, P., De Carufel, J.L., Morin, P., van Renssen, A., Verdonschot, S.: Optimal bounds on theta-graphs: More is not always better. In: CCCG, pp. 305–310 (2012)Google Scholar
  5. 5.
    Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-\(\theta _6\)-graph. In: SODA, pp. 1319–1328 (2012)Google Scholar
  6. 6.
    Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. CGTA 28(1), 11–18 (2004)zbMATHMathSciNetGoogle Scholar
  7. 7.
    Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The \(\theta _5\)-graph is a spanner. In: Brandstädt, A., Jansen, K., Reischuk, R. (eds.) WG 2013. LNCS, vol. 8165, pp. 100–114. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  8. 8.
    Bose, P., van Renssen, A., Verdonschot, S.: On the spanning ratio of theta-graphs. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 182–194. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  9. 9.
    Chew, P.: There are planar graphs almost as good as the complete graph. Journal of Computer and System Sciences 39(2), 205–219 (1989)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Clarkson, K.: Approximation algorithms for shortest path motion planning. In: STOC, pp. 56–65 (1987)Google Scholar
  11. 11.
    El Molla, N.M.: Yao spanners for wireless ad hoc networks. Master’s thesis, Villanova University (2009)Google Scholar
  12. 12.
    Mark Keil, J.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208–213. Springer, Heidelberg (1988)Google Scholar
  13. 13.
    Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)Google Scholar
  14. 14.
    Ruppert, J., Seidel, R.: Approximating the \(d\)-dimensional complete Euclidean graph. In: CCCG, pp. 207–210 (1991)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Pat Morin
    • 1
  • André van Renssen
    • 1
    • 2
    Email author
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.National Institute of InformaticsTokyoJapan

Personalised recommendations