Upward Planar Drawings and Switch-regularity Heuristics
Journal of graph algorithms and applications, Tome 10 (2006) no. 2, pp. 259-285
Cet article a éte moissonné depuis la source Journal of Graph Algorythms and Applications website
In this paper we present a new characterization of switch-regular upward embeddings, a concept introduced by Di Battista and Liotta in 1998. This characterization allows us to define a new efficient algorithm for computing upward planar drawings of embedded planar digraphs. If compared with a popular approach described by Bertolazzi, Di Battista, Liotta, and Mannino, our algorithm computes drawings that are significantly better in terms of total edge length and aspect ratio, especially for low-density digraphs. Also, we experimentally prove that the running time of the drawing process is reduced in most cases.
@article{JGAA_2006_10_2_a7,
author = {Walter Didimo},
title = {Upward {Planar} {Drawings} and {Switch-regularity} {Heuristics}},
journal = {Journal of graph algorithms and applications},
pages = {259--285},
year = {2006},
volume = {10},
number = {2},
doi = {10.7155/jgaa.00127},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00127/}
}
TY - JOUR AU - Walter Didimo TI - Upward Planar Drawings and Switch-regularity Heuristics JO - Journal of graph algorithms and applications PY - 2006 SP - 259 EP - 285 VL - 10 IS - 2 UR - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00127/ DO - 10.7155/jgaa.00127 LA - en ID - JGAA_2006_10_2_a7 ER -
Walter Didimo. Upward Planar Drawings and Switch-regularity Heuristics. Journal of graph algorithms and applications, Tome 10 (2006) no. 2, pp. 259-285. doi: 10.7155/jgaa.00127
Cité par Sources :