Geodesic
1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
Journal of Graph Algorithms and Applications, Tome 5 (2001) no. 3, pp. 1-15.

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

This paper studies three-dimensional orthogonal box-drawings where edge-routes have at most one bend. Two open problems for such drawings are: (1) Does every drawing of $K_n$ have volume $\Omega(n^3)$? (2) Is there a drawing of $K_n$ for which additionally the vertices are represented by cubes with surface $O(n)$? This paper answers both questions in the negative, and provides related results concerning volume bounds as well. 
@article{JGAA_2001_5_3_a0,
     author = {Therese Biedl},
     title = {1-Bend {3-D} {Orthogonal} {Box-Drawings:} {Two} {Open} {Problems} {Solved}},
     journal = {Journal of Graph Algorithms and Applications},
     pages = {1--15},
     publisher = {mathdoc},
     volume = {5},
     number = {3},
     year = {2001},
     doi = {10.7155/jgaa.00034},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00034/}
}
TY  - JOUR
AU  - Therese Biedl
TI  - 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
JO  - Journal of Graph Algorithms and Applications
PY  - 2001
SP  - 1
EP  - 15
VL  - 5
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00034/
DO  - 10.7155/jgaa.00034
LA  - en
ID  - JGAA_2001_5_3_a0
ER  - 
%0 Journal Article
%A Therese Biedl
%T 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved
%J Journal of Graph Algorithms and Applications
%D 2001
%P 1-15
%V 5
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00034/
%R 10.7155/jgaa.00034
%G en
%F JGAA_2001_5_3_a0
Therese Biedl. 1-Bend 3-D Orthogonal Box-Drawings: Two Open Problems Solved. Journal of Graph Algorithms and Applications, Tome 5 (2001) no. 3, pp. 1-15. doi : 10.7155/jgaa.00034. http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00034/

Cité par Sources :