Geodesic
Drawing Planar Graphs with Large Vertices and Thick Edges
Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 3-20.

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

We consider the problem of representing size information in the edges and vertices of a planar graph. Such information can be used, for example, to depict a network of computers and information traveling through the network. We present an efficient linear-time algorithm which draws edges and vertices of varying 2-dimensional areas to represent the amount of information flowing through them. The algorithm avoids all occlusions of nodes and edges, while still drawing the graph on a compact integer grid. 
@article{JGAA_2004_8_1_a0,
     author = {Gill Barequet and Michael Goodrich and Chris Riley},
     title = {Drawing {Planar} {Graphs} with {Large} {Vertices} and {Thick} {Edges}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {3--20},
     publisher = {mathdoc},
     volume = {8},
     number = {1},
     year = {2004},
     doi = {10.7155/jgaa.00078},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00078/}
}
TY  - JOUR
AU  - Gill Barequet
AU  - Michael Goodrich
AU  - Chris Riley
TI  - Drawing Planar Graphs with Large Vertices and Thick Edges
JO  - Journal of Graph Algorithms and Applications
PY  - 2004
SP  - 3
EP  - 20
VL  - 8
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00078/
DO  - 10.7155/jgaa.00078
LA  - en
ID  - JGAA_2004_8_1_a0
ER  - 
%0 Journal Article
%A Gill Barequet
%A Michael Goodrich
%A Chris Riley
%T Drawing Planar Graphs with Large Vertices and Thick Edges
%J Journal of Graph Algorithms and Applications
%D 2004
%P 3-20
%V 8
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00078/
%R 10.7155/jgaa.00078
%G en
%F JGAA_2004_8_1_a0
Gill Barequet; Michael Goodrich; Chris Riley. Drawing Planar Graphs with Large Vertices and Thick Edges. Journal of Graph Algorithms and Applications, Tome 8 (2004) no. 1, pp. 3-20. doi : 10.7155/jgaa.00078. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00078/

Cité par Sources :