Bounds for orthogonal 3-D graph drawing.
Biedl, T.; Shermer, T.; Whitesides, S.; Wismath, S.
Journal of Graph Algorithms and Applications (1999)
- Volume: 3, Issue: 4, page 63-79
- ISSN: 1526-1719
Access Full Article
top
How to cite
topBiedl, T., et al. "Bounds for orthogonal 3-D graph drawing.." Journal of Graph Algorithms and Applications 3.4 (1999): 63-79. <http://eudml.org/doc/48533>.
@article{Biedl1999,
author = {Biedl, T., Shermer, T., Whitesides, S., Wismath, S.},
journal = {Journal of Graph Algorithms and Applications},
keywords = {orthogonal grid drawings},
language = {eng},
number = {4},
pages = {63-79},
publisher = {Brown University, Providence, RI; University of Texas, Dallas},
title = {Bounds for orthogonal 3-D graph drawing.},
url = {http://eudml.org/doc/48533},
volume = {3},
year = {1999},
}
TY - JOUR
AU - Biedl, T.
AU - Shermer, T.
AU - Whitesides, S.
AU - Wismath, S.
TI - Bounds for orthogonal 3-D graph drawing.
JO - Journal of Graph Algorithms and Applications
PY - 1999
PB - Brown University, Providence, RI; University of Texas, Dallas
VL - 3
IS - 4
SP - 63
EP - 79
LA - eng
KW - orthogonal grid drawings
UR - http://eudml.org/doc/48533
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.