Geodesic
Lower Bounds for the Number of Bends in Three-Dimensional Orthogonal Graph Drawings
Journal of Graph Algorithms and Applications, Tome 7 (2003) no. 1, pp. 33-77.

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

This paper presents the first non-trivial lower bounds for the total number of bends in 3-D orthogonal graph drawings with vertices represented by points. In particular, we prove lower bounds for the number of bends in 3-D orthogonal drawings of complete simple graphs and multigraphs, which are tight in most cases. These result are used as the basis for the construction of infinite classes of c-connected simple graphs, multigraphs, and pseudographs (2 ≤ c ≤ 6) of maximum degree ∆ (3 ≤ ∆ ≤ 6), with lower bounds on the total number of bends for all members of the class. We also present lower bounds for the number of bends in general position 3-D orthogonal graph drawings. These results have significant ramifications for the `2-bends problem', which is one of the most important open problems in the field. 
@article{JGAA_2003_7_1_a1,
     author = {David Wood},
     title = {Lower {Bounds} for the {Number} of {Bends} in {Three-Dimensional
}         {Orthogonal} {Graph} {Drawings}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {33--77},
     publisher = {mathdoc},
     volume = {7},
     number = {1},
     year = {2003},
     doi = {10.7155/jgaa.00060},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00060/}
}
TY  - JOUR
AU  - David Wood
TI  - Lower Bounds for the Number of Bends in Three-Dimensional
         Orthogonal Graph Drawings
JO  - Journal of Graph Algorithms and Applications
PY  - 2003
SP  - 33
EP  - 77
VL  - 7
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00060/
DO  - 10.7155/jgaa.00060
LA  - en
ID  - JGAA_2003_7_1_a1
ER  - 
%0 Journal Article
%A David Wood
%T Lower Bounds for the Number of Bends in Three-Dimensional
         Orthogonal Graph Drawings
%J Journal of Graph Algorithms and Applications
%D 2003
%P 33-77
%V 7
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00060/
%R 10.7155/jgaa.00060
%G en
%F JGAA_2003_7_1_a1
David Wood. Lower Bounds for the Number of Bends in Three-Dimensional
         Orthogonal Graph Drawings. Journal of Graph Algorithms and Applications, Tome 7 (2003) no. 1, pp. 33-77. doi : 10.7155/jgaa.00060. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00060/

Cité par Sources :