Geodesic
Drawing Unordered Trees on k-Grids
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Sixth International Workshop on Algorithms and Computation, WALCOM 2012 , Tome 17 (2013) no. 2, pp. 103-128.

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

We present almost linear area bounds for drawing trees on the octagonal grid. For complete 7-ary trees we establish an upper and lower bound of Θ(n1.129) and for complete ternary trees the bounds of O(n1.048) and Θ(n), where the latter needs edge bends. For arbitrary ternary trees we obtain an upper bound of O(n log log n) with bends and good aspect ratio by applying the recursive winding technique. We explore the unit edge length and area complexity of drawing unordered trees on k-grids with k∈{4,6,8} and generalize the NP-hardness results of the orthogonal grid to the octagonal and hexagonal grids.
DOI : 10.7155/jgaa.00287
Keywords: tree drawings, k-grid, minimum area, unit edge length 
@article{JGAA_2013_17_2_a3,
     author = {Christian Bachmaier and Marco Matzeder},
     title = {Drawing {Unordered} {Trees} on {k-Grids}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {103--128},
     publisher = {mathdoc},
     volume = {17},
     number = {2},
     year = {2013},
     doi = {10.7155/jgaa.00287},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00287/}
}
TY  - JOUR
AU  - Christian Bachmaier
AU  - Marco Matzeder
TI  - Drawing Unordered Trees on k-Grids
JO  - Journal of Graph Algorithms and Applications
PY  - 2013
SP  - 103
EP  - 128
VL  - 17
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00287/
DO  - 10.7155/jgaa.00287
LA  - en
ID  - JGAA_2013_17_2_a3
ER  - 
%0 Journal Article
%A Christian Bachmaier
%A Marco Matzeder
%T Drawing Unordered Trees on k-Grids
%J Journal of Graph Algorithms and Applications
%D 2013
%P 103-128
%V 17
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00287/
%R 10.7155/jgaa.00287
%G en
%F JGAA_2013_17_2_a3
Christian Bachmaier; Marco Matzeder. Drawing Unordered Trees on k-Grids. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Sixth International Workshop on Algorithms and Computation, WALCOM 2012
					, Tome 17 (2013) no. 2, pp. 103-128. doi : 10.7155/jgaa.00287. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00287/

Cité par Sources :