Succinct greedy graph drawing in the hyperbolic plane

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5417 LNCS, Issue , 2009, Pages 14-25

  Eppstein, David ^a   Goodrich, Michael T ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

GRAPH DRAWING; GRAPH G; HYPERBOLIC PLANE;

GRAPH THEORY;

EID: 68749111921     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-00219-9_3     Document Type: Conference Paper

References (21)

1. Alstrup, S., Lauridsen, P.W., Sommerlund, P., Thorup, M.: Finding cores of limited length. In: Rau-Chaplin, A., Dehne, F., Sack, J.-R., Tamassia, R. (eds.) WADS 1997. LNCS, vol. 1272, pp. 45-54. Springer, Heidelberg (1997)
2. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with Guaranteed Delivery in Ad Hoc Wireless Networks. Wireless Networks 6(7), 609-616 (2001)
3. Chen, M.B., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Proc. 23rd Symp. Computational Geometry (SoCG 1997), pp. 210-219 (1997)
4. Dhandapani, R.: Greedy drawings of triangulations. In: Proc. 19th ACM-SIAM Symp. Discrete Algorithms (SODA 2008), pp. 102-111 (2008)
5. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41-51 (1990)
6. Gilbert, E.N., Moore, E.F.: Variable-Length binary encodings. Bell System Tech. J. 38, 933-968 (1959)
7. Karp, B., Kung, H.T.: GPSR: greedy perimeter stateless routing for wireless networks. In: Proc. 6th ACM Mobile Computing and Networking (MobiCom), pp. 243-254 (2000)
8. Kleinberg, R.: Geographic Routing Using Hyperbolic Space. In: Proc. 26th IEEE Int. Conf. Computer Communications (INFOCOM 2007), pp. 1902-1909. IEEE Press, Los Alamitos (2007)
9. Kranakis, E., Singh, H., Urrutia, J.: Compass routing on geometric networks. In: Proc. 11th Canad. Conf. Computational Geometry (CCCG), pp. 51-54 (1999)
10. Kuhn, F., Wattenhofer, R., Zhang, Y., Zollinger, A.: Geometric ad-hoc routing: of theory and practice. In: Proc. 22nd ACM Symp. Principles of Distributed Computing (PODC), pp. 63-72 (2003)
11. Kuhn, F., Wattenhofer, R., Zollinger, A.: Asymptotically optimal geometric mobile ad-hoc routing. In: Proc. 6th ACM Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), pp. 24-33 (2002)
12. Kuhn, F., Wattenhofer, R., Zollinger, A.: Worst-Case optimal and average-case efficient geometric ad-hoc routing. In: Proc. 4th ACM Symp. Mobile Ad Hoc Networking & Computing (MobiHoc), pp. 267-278 (2003)
13. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proc. 49th IEEE Symp. Foundations of Computer Science (FOCS) (2008)
14. Lillis, K.M., Pemmaraju, S.V.: On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations. In: McGeoch, C.C. (ed.) WEA 2008. LNCS, vol. 5038, pp. 69-86. Springer, Heidelberg (2008)
15. Maymounkov, P.: Greedy Embeddings, Trees, and Euclidean vs. Lobachevsky Geometry. M.I.T (manuscript, 2006), http://pdos.csail.mit.edu/~petar/papers/ maymounkov-greedy-prelim.pdf
16. Muhammad, R.B.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proc. IEEE Conf. Information Technology (ITNG), pp. 961-963 (2007)
17. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3-14 (2005)
18. Rao, A., Ratnasamy, S., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Proc. 9th Int. Conf. Mobile Computing and Networking (MobiCom 2003), pp. 96-108. ACM, New York (2003)
19. Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17(6), 1253-1262 (1988)
20. Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138-148 (1990)
21. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. J. Comp. and Sys. Sci. 26(3), 362-391 (1983)