Geodesic
Algorithms and Bounds for Overloaded Orthogonal Drawings
Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 217-246.

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

Orthogonal drawings are widely used for graph visualization due to their high clarity and ease of representation. But when it comes to high-degree and massive graphs, even orthogonal drawings have difficulties producing a clean and simple visualization. In this paper we present a technique called Overloaded Orthogonal Drawing that greatly improves the readability by proposing a new vertex placement and reframing the orthogonal edge routing approach. We first place the vertices on grid points following a relaxed version of dominance drawing, called weak dominance condition. Edge routing is implied automatically by the vertex coordinates. In order to simplify these drawings we use an overloading technique of the edges. All algorithms are simple and easy to implement and can be applied to directed acyclic graphs, planar, non-planar and undirected graphs. We also present bounds on the number of bends and the area. Overloaded orthogonal drawings present several interesting properties such as efficient visual edge confirmation as well as clarity of the drawing. 
@article{JGAA_2016_20_2_a2,
     author = {Evgenios Kornaropoulos and Ioannis Tollis},
     title = {Algorithms and {Bounds} for {Overloaded} {Orthogonal} {Drawings}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {217--246},
     publisher = {mathdoc},
     volume = {20},
     number = {2},
     year = {2016},
     doi = {10.7155/jgaa.00391},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00391/}
}
TY  - JOUR
AU  - Evgenios Kornaropoulos
AU  - Ioannis Tollis
TI  - Algorithms and Bounds for Overloaded Orthogonal Drawings
JO  - Journal of Graph Algorithms and Applications
PY  - 2016
SP  - 217
EP  - 246
VL  - 20
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00391/
DO  - 10.7155/jgaa.00391
LA  - en
ID  - JGAA_2016_20_2_a2
ER  - 
%0 Journal Article
%A Evgenios Kornaropoulos
%A Ioannis Tollis
%T Algorithms and Bounds for Overloaded Orthogonal Drawings
%J Journal of Graph Algorithms and Applications
%D 2016
%P 217-246
%V 20
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00391/
%R 10.7155/jgaa.00391
%G en
%F JGAA_2016_20_2_a2
Evgenios Kornaropoulos; Ioannis Tollis. Algorithms and Bounds for Overloaded Orthogonal Drawings. Journal of Graph Algorithms and Applications, Tome 20 (2016) no. 2, pp. 217-246. doi : 10.7155/jgaa.00391. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00391/

Cité par Sources :