Three approaches to 3D-orthogonal box-drawings

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

Volumn 1547, Issue , 1999, Pages 30-43

  Biedl, Therese C ^a  

^a MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957922838     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_3     Document Type: Conference Paper

References (15)

1. T. Biedl and G. Kant. A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications, 9:159-180, 1998.
2. T. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In 5th European Symposium on Algorithms, volume 1284 of Lecture Notes in Computer Science, pages 37-52. Springer-Verlag, 1997.
3. T. Biedl, B. Madden, and I. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In DiBattista [7], pages 391-402.
4. T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Orthogonal 3-D graph drawing. In DiBattista [7], pages 76-86.
5. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comp. Geometry: Theory and Applications, 4(5):235-282, 1994.
6. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Computational Geometry: Theory and Applications, 7(5-6), 1997.
7. G. Di Battista, editor. Symposium on Graph Drawing 97, volume 1353 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
8. P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, editor. Symposium on Graph Drawing 96, volume 1190 of Lecture Notes in Computer Science. Springer-Verlag, 1997, pp. 139-154.
9. U. Fößmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F. Brandenburg, editor. Symposium on Graph Drawing 95, volume 1027 of Lecture Notes in Computer Science. Springer-Verlag, 1996, pages 254-266.
10. U. Fößmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In DiBattista [7], pages 134-145.
11. A. Papakostas and I. Tollis. High-degree orthogonal drawings with small grid-size and few bends. In 5th Workshop on Algorithms and Data Structures, volume 1272 of Lecture Notes in Computer Science, pages 354-367. Springer-Verlag, 1997.
12. A. Papakostas and I. Tollis. Algorithms for area-efficient orthogonal drawings. Computational Geometry: Theory and Applications, 9:83-110, 1998.
13. A. Papakostas and I. Tollis. Incremental orthogonal graph drawing in three dimensions. In DiBattista [7], pages 52-63.
14. A. Rosenberg. Three-dimensional VLSI: A case study. Journal of the Association of Computing Machinery, 30(3):397-416, 1983.
15. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing, 16(3):421-444, 1987.