Succinct greedy geometric routing in the euclidean plane

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

Volumn 5878 LNCS, Issue , 2009, Pages 781-791

  Goodrich, Michael T ^a   Strash, Darren ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

3-CONNECTED PLANAR GRAPHS; EUCLIDEAN METRICS; EUCLIDEAN PLANES; GEOMETRIC ROUTING;

COMPUTATION THEORY;

EID: 75649097477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-10631-6_79     Document Type: Conference Paper

References (9)

1. Angelini, P., Frati, F., Grilli, L.: An algorithm to construct greedy drawings of triangulations. In: Tollis, I.G., Patrignani, M. (eds.) GD 2008. LNCS, vol. 5417, pp. 26-37. Springer, Heidelberg (2009)
2. Dhandapani, R.: Greedy drawings of triangulations. In: Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA 2008), pp. 102-111. SIAM, Philadelphia (2008)
3. 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)
4. Knuth, D.E.: Optimum binary search trees. Acta Informatica 1, 14-25 (1971)
5. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: Proceedings of the 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2008), pp. 337-346. IEEE Press, Los Alamitos (2008)
6. 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)
7. Muhammad, R.B.: A distributed geometric routing algorithm for ad hoc wireless networks. In: Proceedings of the 4th International Conference on Information Technology (ITNG 2007), pp. 961-963. IEEE Press, Los Alamitos (2007)
8. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theoretical Computer Science 344(1), 3-14 (2005)
9. Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. Journal of Computer and System Sciences 26(3), 362-391 (1983)