Low Distortion Delaunay Embedding of Trees in Hyperbolic Plane

  • Rik Sarkar
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7034)


This paper considers the problem of embedding trees into the hyperbolic plane. We show that any tree can be realized as the Delaunay graph of its embedded vertices. Particularly, a weighted tree can be embedded such that the weight on each edge is realized as the hyperbolic distance between its embedded vertices. Thus the embedding preserves the metric information of the tree along with its topology. The distance distortion between non adjacent vertices can be made arbitrarily small – less than a (1 + ε) factor for any given ε. Existing results on low distortion of embedding discrete metrics into trees carry over to hyperbolic metric through this result. The Delaunay character implies useful properties such as guaranteed greedy routing and realization as minimum spanning trees.


Minimum Span Tree Voronoi Diagram Voronoi Cell Hyperbolic Plane Weighted Tree 
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.
    Chepoi, V., Dragan, F., Estellon, B., Habib, M., Vaxès, Y., Xiang, Y.: Additive spanners and distance and routing labeling schemes for hyperbolic graphs. Algorithmica, 1–20 (2010), doi:10.1007/s00453-010-9478-xGoogle Scholar
  2. 2.
    Cvetkovski, A., Crovella, M.: Hyperbolic embedding and routing for dynamic graphs. In: Proceedings of Infocom 2009 (April 2009)Google Scholar
  3. 3.
    Dhamdhere, K., Gupta, A., Räcke, H.: Improved embeddings of graph metrics into random trees. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm, SODA 2006, pp. 61–69 (2006)Google Scholar
  4. 4.
    Elkin, M., Emek, Y., Spielman, D.A., Teng, S.-H.: Lower-stretch spanning trees. In: Proceedings of the Thirty-Seventh Annual ACM Symposium on Theory of Computing, STOC 2005, pp. 494–503 (2005)Google Scholar
  5. 5.
    Eppstein, D., Goodrich, M.T.: Succinct Greedy Graph Drawing in the Hyperbolic Plane. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 14–25. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Fakcharoenphol, J., Rao, S., Talwar, K.: A tight bound on approximating arbitrary metrics by tree metrics. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, pp. 448–455 (2003)Google Scholar
  7. 7.
    Greenberg, M.J.: Euclidean and Non-Euclidean Geometries. W.H. Freeman (1993)Google Scholar
  8. 8.
    Gromov, M.: Hyperbolic groups. In: Essays In Group Theory, pp. 75–263. Springer, New York (1987)CrossRefGoogle Scholar
  9. 9.
    Kleinberg, R.: Geographic routing using hyperbolic space. In: Proceedings of the 26th Conference of the IEEE Communications Society (INFOCOM 2007), pp. 1902–1909 (2007)Google Scholar
  10. 10.
    Lee, J., Naor, A., Peres, Y.: Trees and markov convexity. Geometric and Functional Analysis 18, 1609–1659 (2009), doi:10.1007/s00039-008-0689-0MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Monma, C., Suri, S.: Transitions in geometric minimum spanning trees (extended abstract). In: Proceedings of the Seventh Annual Symposium on Computational Geometry, pp. 239–249 (1991)Google Scholar
  12. 12.
    Papadopoulos, F., Krioukov, D., Boguñá, M., Vahdat, A.: Greedy forwarding in dynamic scale-free networks embedded in hyperbolic metric spaces. In: Proceedings of the 29th Conference on Information Communications, INFOCOM 2010, pp. 2973–2981 (2010)Google Scholar
  13. 13.
    Sarkar, R.: Low distortion delaunay embedding of trees in hyperbolic plane,
  14. 14.
    Tanuma, T., Imai, H., Moriyama, S.: Revisiting hyperbolic voronoi diagrams from theoretical, applied and generalized viewpoints. In: International Symposium on Voronoi Diagrams in Science and Engineering, pp. 23–32 (2010)Google Scholar
  15. 15.
    Zeng, W., Sarkar, R., Luo, F., Gu, X.D., Gao, J.: Resilient routing for sensor networks using hyperbolic embedding of universal covering space. In: Proc. of the 29th Annual IEEE Conference on Computer Communications (INFOCOM 2010) (April 2010)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Rik Sarkar
    • 1
  1. 1.Institut Für InformatikFreie Universität BerlinGermany

Personalised recommendations