Skip to main content
SpringerLink
Log in

On the Stretch Factor of the Theta-4 Graph

  • Conference paper
Algorithms and Data Structures (WADS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8037))

Included in the following conference series:

Abstract

In this paper we show that the θ-graph with 4 cones has constant stretch factor, i.e., there is a path between any pair of vertices in this graph whose length is at most a constant times the Euclidean distance between that pair of vertices. This is the last θ-graph for which it was not known whether its stretch factor was bounded.

Research supported in part by NSERC and FQRNT.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)

    Chapter  Google Scholar 

  2. Bonichon, N., Gavoille, C., Hanusse, N., Perković, L.: The stretch factor of L 1- and L  ∞ -Delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 205–216. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  3. Bose, P., Damian, M., Douïeb, K., O’Rourke, J., Seamone, B., Smid, M., Wuhrer, S.: π/2-angle Yao graphs are spanners. International Journal of Computational Geometry & Applications 22(1), 61–82 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  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: Proceedings of CCCG, pp. 305–310 (2012)

    Google Scholar 

  5. Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The θ 5-graph is a spanner. To appear in the proceedings of WG 2013 (2013)

    Google Scholar 

  6. 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)

    Google Scholar 

  7. Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of STOC, pp. 56–65 (1987)

    Google Scholar 

  8. El Molla, N.M.: Yao spanners for wireless ad hoc networks. Master’s thesis, Villanova University (2009)

    Google Scholar 

  9. Keil, J.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208–213. Springer, Heidelberg (1988)

    Chapter  Google Scholar 

  10. Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press (2007)

    Google Scholar 

  11. Ruppert, J., Seidel, R.: Approximating the d-dimensional complete Euclidean graph. In: Proceedings of CCCG, pp. 207–210 (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Carleton University, Ottawa, Canada

    Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, André van Renssen & Sander Verdonschot

  2. Département d’Informatique, Université Libre de Bruxelles, Brussels, Belgium

    Luis Barba

Authors
  1. Luis Barba
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Prosenjit Bose
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jean-Lou De Carufel
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. André van Renssen
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Sander Verdonschot
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Science, Parallel Computing and Bioinformatics Laboratory, Carleton University, VISM Building, Room 6210, 1125 Colonel By Drive, K1S 5B6, Ottawa, ON, Canada

    Frank Dehne

  2. Department of Computer Science, The University of Western Ontario, N6A 5B7, London, ON, Canada

    Roberto Solis-Oba

  3. School of Computer Science, Carleton University, K1S 5B6, Ottawa, ON, Canada

    Jörg-Rüdiger Sack

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Barba, L., Bose, P., De Carufel, JL., van Renssen, A., Verdonschot, S. (2013). On the Stretch Factor of the Theta-4 Graph. In: Dehne, F., Solis-Oba, R., Sack, JR. (eds) Algorithms and Data Structures. WADS 2013. Lecture Notes in Computer Science, vol 8037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40104-6_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-40104-6_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-40103-9

  • Online ISBN: 978-3-642-40104-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation