Planar Octilinear Drawings with One Bend Per Edge
Journal of Graph Algorithms and Applications, Special Issue on Selected Papers from the Twenty-second International Symposium on Graph Drawing, GD 2014 , Tome 19 (2015) no. 2, pp. 657-680.

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

In octilinear drawings of planar graphs, every edge is drawn as a sequence of horizontal, vertical and diagonal (45°) line segments. In this paper, we study octilinear drawings of low edge complexity, i.e., with few bends per edge. A k-planar graph is a planar graph in which each vertex has degree at most k. In particular, we prove that every 4-planar graph admits a planar octilinear drawing with at most one bend per edge on an integer grid of size O(n2) ×O(n). For 5-planar graphs, we prove that one bend per edge still suffices in order to construct planar octilinear drawings, but in super-polynomial area. However, for 6-planar graphs we give a class of graphs whose planar octilinear drawings require at least two bends per edge for some edges.
DOI : 10.7155/jgaa.00369
Keywords: Octilinear graph drawing, Bew bends, Bounded degree graphs
@article{JGAA_2015_19_2_a4,
     author = {Michael Bekos and Martin Gronemann and Michael Kaufmann and Robert Krug},
     title = {Planar {Octilinear} {Drawings} with {One} {Bend} {Per} {Edge}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {657--680},
     publisher = {mathdoc},
     volume = {19},
     number = {2},
     year = {2015},
     doi = {10.7155/jgaa.00369},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00369/}
}
TY  - JOUR
AU  - Michael Bekos
AU  - Martin Gronemann
AU  - Michael Kaufmann
AU  - Robert Krug
TI  - Planar Octilinear Drawings with One Bend Per Edge
JO  - Journal of Graph Algorithms and Applications
PY  - 2015
SP  - 657
EP  - 680
VL  - 19
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00369/
DO  - 10.7155/jgaa.00369
LA  - en
ID  - JGAA_2015_19_2_a4
ER  - 
%0 Journal Article
%A Michael Bekos
%A Martin Gronemann
%A Michael Kaufmann
%A Robert Krug
%T Planar Octilinear Drawings with One Bend Per Edge
%J Journal of Graph Algorithms and Applications
%D 2015
%P 657-680
%V 19
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00369/
%R 10.7155/jgaa.00369
%G en
%F JGAA_2015_19_2_a4
Michael Bekos; Martin Gronemann; Michael Kaufmann; Robert Krug. Planar Octilinear Drawings with One Bend Per Edge. Journal of Graph Algorithms and Applications, 
							Special Issue on Selected Papers from the Twenty-second International Symposium on Graph Drawing, GD 2014
					, Tome 19 (2015) no. 2, pp. 657-680. doi : 10.7155/jgaa.00369. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00369/

Cité par Sources :