Competitive Local Routing with Constraints

  • Prosenjit Bose
  • Rolf Fagerberg
  • André van RenssenEmail author
  • Sander Verdonschot
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9472)


Let P be a set of n vertices in the plane and S a set of non-crossing line segments between vertices in P, called constraints. Two vertices are visible if the straight line segment connecting them does not properly intersect any constraints. The constrained \(\theta _m\)-graph is constructed by partitioning the plane around each vertex into m disjoint cones with aperture \(\theta = 2\uppi /m\), and adding an edge to the ‘closest’ visible vertex in each cone. We consider how to route on the constrained \(\theta _6\)-graph. We first show that no deterministic 1-local routing algorithm is \(o(\sqrt{n})\)-competitive on all pairs of vertices of the constrained \(\theta _6\)-graph. After that, we show how to route between any two visible vertices using only 1-local information, while guaranteeing that the returned path has length at most 2 times the Euclidean distance between the source and destination. To the best of our knowledge, this is the first local routing algorithm in the constrained setting with guarantees on the path length.


Short Path Line Segment Positive Cone Straight Line Segment Short Path Length 
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.


  1. 1.
    Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: WG, pp. 266–278 (2010)Google Scholar
  2. 2.
    Bose, P., Brodnik, A., Carlsson, S., Demaine, E.D., Fleischer, R., López-Ortiz, A., Morin, P., Munro, I.J.: Online routing in convex subdivisions. Int. J. Comput. Geom. App. 12(04), 283–295 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: Competitive routing in the half-\(\theta _6\)-graph. In: SODA, pp. 1319–1328 (2012). To appear in SIAM J. ComputGoogle Scholar
  4. 4.
    Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. In: Fernández-Baca, D. (ed.) LATIN 2012. LNCS, vol. 7256, pp. 85–96. Springer, Heidelberg (2012) CrossRefGoogle Scholar
  5. 5.
    Bose, P., Fagerberg, R., van Renssen, A.,Verdonschot, S.: Competitive local routing with constraints. ArXiv e-prints (2014). arXiv:1412.0760 [cs.CG]
  6. 6.
    Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: ISVD, pp. 25–31 (2006)Google Scholar
  7. 7.
    Bose, P., van Renssen, A.: Upper bounds on the spanning ratio of constrained theta-graphs. In: Pardo, A., Viola, A. (eds.) LATIN 2014. LNCS, vol. 8392, pp. 108–119. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  8. 8.
    Clarkson, K.: Approximation algorithms for shortest path motion planning. In: STOC, pp. 56–65 (1987)Google Scholar
  9. 9.
    Das, G.: The visibility graph contains a bounded-degree spanner. In: CCCG, pp. 70–75 (1997)Google Scholar
  10. 10.
    Misra, S.C., Woungang, I., Misra, S. (eds.): Guide to Wireless Sensor Networks. Springer, London (2009) zbMATHGoogle Scholar
  11. 11.
    Räcke, H.: Survey on oblivious routing strategies. In: Ambos-Spies, K., Löwe, B., Merkle, W. (eds.) CiE 2009. LNCS, vol. 5635, pp. 419–429. Springer, Heidelberg (2009) CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2015

Authors and Affiliations

  • Prosenjit Bose
    • 1
  • Rolf Fagerberg
    • 2
  • André van Renssen
    • 3
    • 4
    Email author
  • Sander Verdonschot
    • 1
  1. 1.School of Computer ScienceCarleton UniversityOttawaCanada
  2. 2.Department of Mathematics and Computer ScienceUniversity of Southern DenmarkOdenseDenmark
  3. 3.National Institute of Informatics (NII)TokyoJapan
  4. 4.JST, ERATO, Kawarabayashi Large Graph ProjectTokyoJapan

Personalised recommendations