Abstract
We show an algorithm to construct greedy drawings of every given triangulation.
Work partially supported by MUR under Project “MAINSTREAM: Algoritmi per strutture informative di grandi dimensioni e data streams” and by the Italian Ministry of Research, Grant number RBIP06BZW8, project FIRB “Advanced tracking system in intermodal freight transportation”.
Chapter PDF
Similar content being viewed by others
Keywords
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.
References
Ben-Chen, M., Gotsman, C., Gortler, S.J.: Routing with guaranteed delivery on virtual coordinates. In: CCCG 2006 (2006)
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)
Dhandapani, R.: Greedy drawings of triangulations. In: Huang, S.-T. (ed.) SODA 2008, pp. 102–111. SIAM, Philadelphia (2008)
de Fraysseix, H., Pach, J., Pollack, R.: How to draw a planar graph on a grid. Combinatorica 10(1), 41–51 (1990)
Kleinberg, R.: Geographic routing using hyperbolic space. In: INFOCOM 2007, pp. 1902–1909. IEEE, Los Alamitos (2007)
Knaster, B., Kuratowski, C., Mazurkiewicz, C.: Ein beweis des fixpunktsatzes fur n dimensionale simplexe. Fundamenta Mathematicae 14, 132–137 (1929)
Leighton, T., Moitra, A.: Some results on greedy embeddings in metric spaces. In: FOCS 2008 (2008)
Papadimitriou, C.H., Ratajczak, D.: On a conjecture related to geometric routing. Theor. Comput. Sci. 344(1), 3–14 (2005)
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)
Schnyder, W.: Embedding planar graphs on the grid. In: SODA 1990, pp. 138–148. SIAM, Philadelphia (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Angelini, P., Frati, F., Grilli, L. (2009). An Algorithm to Construct Greedy Drawings of Triangulations. In: Tollis, I.G., Patrignani, M. (eds) Graph Drawing. GD 2008. Lecture Notes in Computer Science, vol 5417. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00219-9_4
Download citation
DOI: https://doi.org/10.1007/978-3-642-00219-9_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00218-2
Online ISBN: 978-3-642-00219-9
eBook Packages: Computer ScienceComputer Science (R0)