An algorithm to construct greedy drawings of triangulations

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

Volumn 5417 LNCS, Issue , 2009, Pages 26-37

  Angelini, Patrizio ^a   Frati, Fabrizio ^a   Grilli, Luca ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

GREEDY DRAWINGS;

TRIANGULATION;

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

References (10)

1. Ben-Chen, M., Gotsman, C., Gortler, S.J.: Routing with guaranteed delivery on virtual coordinates. In: CCCG 2006 (2006)
2. Ben-Chen, M., Gotsman, C., Wormser, C.: Distributed computation of virtual coordinates. In: Erickson, J. (ed.) SoCG 2007, pp. 210-219. ACM Press, New York (2007)
3. Dhandapani, R.: Greedy drawings of triangulations. In: Huang, S.-T. (ed.) SODA 2008, pp. 102-111. SIAM, Philadelphia (2008)
4. de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41-51 (1990)
5. Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007, pp. 1902-1909. IEEE, Los Alamitos (2007)
6. Knaster, B., Kuratowski, C., Mazurkiewicz, C.: Ein beweis des fixpunktsatzes fur n dimensionale simplexe. Fundamenta Mathematicae 14, 132-137 (1929)
7. Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: FOCS 2008 (2008)
8. Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3-14 (2005)
9. Rao, A., Papadimitriou, C.H., Shenker, S., Stoica, I.: Geographic routing without location information. In: Johnson, D.B., Joseph, A.D., Vaidya, N.H. (eds.) MOBICOM 2003, pp. 96-108. ACM Press, New York (2003)
10. Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138-148. SIAM, Philadelphia (1990)