Geodesic
Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Eleventh International Symposium on Graph Drawing, GD 2003 , Tome 9 (2005) no. 1, pp. 31-52.

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

We introduce a new approach for drawing diagrams. Our approach is to use a technique we call confluent drawing for visualizing non-planar graphs in a planar way. This approach allows us to draw, in a crossing-free manner, graphs-such as software interaction diagrams-that would normally have many crossings. The main idea of this approach is quite simple: we allow groups of edges to be merged together and drawn as "tracks" (similar to train tracks). Producing such confluent drawings automatically from a graph with many crossings is quite challenging, however, we offer a heuristic algorithm (one version for undirected graphs and one version for directed ones) to test if a non-planar graph can be drawn efficiently in a confluent way. In addition, we identify several large classes of graphs that can be completely categorized as being either confluently drawable or confluently non-drawable. 
@article{JGAA_2005_9_1_a3,
     author = {Matthew Dickerson and David Eppstein and Michael Goodrich and Jeremy Meng},
     title = {Confluent {Drawings:} {Visualizing} {Non-planar} {Diagrams} in a {Planar} {Way}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {31--52},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2005},
     doi = {10.7155/jgaa.00099},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00099/}
}
TY  - JOUR
AU  - Matthew Dickerson
AU  - David Eppstein
AU  - Michael Goodrich
AU  - Jeremy Meng
TI  - Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
JO  - Journal of Graph Algorithms and Applications
PY  - 2005
SP  - 31
EP  - 52
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00099/
DO  - 10.7155/jgaa.00099
LA  - en
ID  - JGAA_2005_9_1_a3
ER  - 
%0 Journal Article
%A Matthew Dickerson
%A David Eppstein
%A Michael Goodrich
%A Jeremy Meng
%T Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way
%J Journal of Graph Algorithms and Applications
%D 2005
%P 31-52
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00099/
%R 10.7155/jgaa.00099
%G en
%F JGAA_2005_9_1_a3
Matthew Dickerson; David Eppstein; Michael Goodrich; Jeremy Meng. Confluent Drawings: Visualizing Non-planar Diagrams in a Planar Way. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Eleventh International Symposium on Graph Drawing, GD 2003
					, Tome 9 (2005) no. 1, pp. 31-52. doi : 10.7155/jgaa.00099. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00099/

Cité par Sources :