Orthogonal 3-D graph drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1353, Issue , 1997, Pages 76-86

  Biedl, T ^a   Shermer, T ^b   Whitesides, S ^a   Wismath, S ^c  

^a MCGILL UNIVERSITY   (Canada)

^b SIMON FRASER UNIVERSITY   (Canada)

^c UNIVERSITY OF LETHBRIDGE   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

IMAGE SEGMENTATION;

ARBITRARY DEGREE; BOUNDING BOX; GRAPH DRAWING; LOWER BOUNDS; ORTHOGONAL GRID DRAWINGS;

DRAWING (GRAPHICS);

EID: 0004445915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_52     Document Type: Conference Paper

References (13)

1. P. Bose, H. Everett, S. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer and S. Whitesides. On a visibility representation for graphs in three dimensions. Proc. Graph Drawing '93, Paris, 1993, 38-39.
2. T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In These proceedings.
3. F. Brandenburg, ed. Symposium on Graph Drawing '95, Passau, Germany, Springer-Verlag LNCS 1027, 1996.
4. P. Eades, A. Symvonis and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, ed. Symposium on Graph Drawing '96, Berkeley, California, Springer Verlag LNCS 1190, 1997, 139-154.
5. S. Fekete, M. Houle and S. Whitesides. New results on a visibility representation of graphs in 3d. In [Bra96], 234-241.
6. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In [Bra96], 254-266.
7. R. Graham, B.L. Rothschild and J. Spencer. Ramsey Theory. John Wiley, 1980.
8. A. Papakostas and I. Tollis. High-degree orthogonal drawings with small gridsize and few bends. In 5th Workshop on Algorithms and Data Structures, Springer Verlag LNCS, 1997. To appear.
9. A. Papakostas and I. Tollis. Incremental orthogonal graph drawing in three dimensions. In these proceedings.
10. A. Rosenberg. Three-dimensional VLSI: A case study. Journal of the Association of Computing Machinery, 30 (3), 1983, 397-416.
11. R. Tamassia and I. Tollis. A unified approach to visibility representations of planar graphs. J. of Discrete and Computational Geometry 1, 1986, 321-341.
12. S. K. Wismath. Characterizing bay line-of-sight graphs. Proc. of the 1st ACM Syrup. on Computational Geometry, Baltimore, Maryland, USA, 1985, 147-152.
13. M. Yannakakis, Embedding planar graphs in four pages. 18th Annual ACM Symposium on Theory of Computing, J. Comput. System Sci. 38 (1989), no. 1, 36-67.