Geodesic
An Algorithm to Construct Greedy Drawings of Triangulations
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Sixteenth International Symposium on Graph Drawing, GD 2008 , Tome 14 (2010) no. 1, pp. 19-51.

Voir la notice de l'article provenant de la source Journal of Graph Algorythms and Applications website

We show an algorithm to construct a greedy drawing of every given triangulation. The algorithm relies on two main results. First, we show how to construct greedy drawings of a fairly simple class of graphs, called triangulated binary cactuses. Second, we show that every triangulation can be spanned by a triangulated binary cactus. Further, we discuss how to extend our techniques in order to prove that every triconnected planar graph admits a greedy drawing. Such a result, which proves a conjecture by Papadimitriou and Ratajczak, was independently shown by Leighton and Moitra. 
@article{JGAA_2010_14_1_a2,
     author = {Patrizio Angelini and Fabrizio Frati and Luca Grilli},
     title = {An {Algorithm} to {Construct} {Greedy} {Drawings} of {Triangulations}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {19--51},
     publisher = {mathdoc},
     volume = {14},
     number = {1},
     year = {2010},
     doi = {10.7155/jgaa.00197},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00197/}
}
TY  - JOUR
AU  - Patrizio Angelini
AU  - Fabrizio Frati
AU  - Luca Grilli
TI  - An Algorithm to Construct Greedy Drawings of Triangulations
JO  - Journal of Graph Algorithms and Applications
PY  - 2010
SP  - 19
EP  - 51
VL  - 14
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00197/
DO  - 10.7155/jgaa.00197
LA  - en
ID  - JGAA_2010_14_1_a2
ER  - 
%0 Journal Article
%A Patrizio Angelini
%A Fabrizio Frati
%A Luca Grilli
%T An Algorithm to Construct Greedy Drawings of Triangulations
%J Journal of Graph Algorithms and Applications
%D 2010
%P 19-51
%V 14
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00197/
%R 10.7155/jgaa.00197
%G en
%F JGAA_2010_14_1_a2
Patrizio Angelini; Fabrizio Frati; Luca Grilli. An Algorithm to Construct Greedy Drawings of Triangulations. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Sixteenth International Symposium on Graph Drawing, GD 2008
					, Tome 14 (2010) no. 1, pp. 19-51. doi : 10.7155/jgaa.00197. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00197/

Cité par Sources :