Multi-dimensional orthogonal graph drawing with small boxes

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

Volumn 1731, Issue , 1999, Pages 311-322

  Wood, David R ^a  

^a MONASH UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

ASPECT RATIO; DRAWING (GRAPHICS);

ARBITRARY DEGREE; LAY-OUT; MULTI DIMENSIONAL; ORTHOGONAL DRAWINGS; ORTHOGONAL GRAPHS; ORTHOGONAL GRID; POSITION MODEL;

ALGORITHMS;

EID: 84958981448     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_32     Document Type: Conference Paper

References (23)

1. T. Biedl and M. Kaufmann. Area-efficient static and incremental graph drawings. In R. Burkhard and G. Woeginger, editors, Proc. Algorithms: 5th Annual European Symp. (ESA'97), volume 1284 of Lecture Notes in Comput. Sci., pages 37-52, Berlin, 1997. Springer.
2. T. Biedl, B. Madden, and I.G. Tollis. The three-phase method: A unified approach to orthogonal graph drawing. In Di Battista [5], pages 391-402.
3. T. Biedl, T. Shermer, S. Whitesides, and S. Wismath. Orthogonal 3-D graph drawing. In Di Battista [5], pages 76-86.
4. T.C. Biedl. Three approaches to 3D-orthogonal box-drawings. In Whitesides [20], pages 30-43.
5. G. Di Battista, editor. Proc. Graph Drawing: 5th International Symp. (GD'97), volume 1353 of Lecture Notes in Comput. Sci., Berlin, 1998. Springer.
6. G. Di Battista, W. Didimo, M. Patrignani, and M. Pizzonia. Orthogonal and quasi-upward drawings with vertices of arbitrary size. In J. Kratochvil, editor, Proc. Graph Drawing: 7th International Symp. (GD'99), Lecture Notes in Comput. Sci., Berlin. Springer. to appear.
7. G. Di Battista, P. Eades, R. Tamassia, and I.G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, New Jersey, 1999.
8. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom., 7(5-6):303-325, 1997.
9. W. Didimo and G. Liotta. Computing orthogonal drawings in a variable embedding setting. In K.-Y. Chwa and O. H. Ibarra, editors, Proc. Algorithms and Computation (ISAAC'98), volume 1533 of Lecture Notes in Comput. Sci., pages 79-88, Berlin, 1998. Springer.
10. P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In North [16], pages 139-154.
11. P. Eades, A. Symvonis, and S. Whitesides. Three dimensional orthogonal graph drawing algorithms. 1998. submitted.
12. S. Even and G. Granot. Grid layouts of block diagrams | bounding the number of bends in each connection. In R. Tamassia and I.G. Tollis, editors, Proc. Graph Drawing: DIMACS International Workshop (GD'94), volume 894 of Lecture Notes in Comput. Sci., pages 64-75, Berlin, 1995. Springer.
13. U. Föβmeier, G. Kant, and M. Kaufmann. 2-visibility drawings of planar graphs. In North [16], pages 155-158.
14. U. Föβmeier and M. Kaufmann. Drawing high degree graphs with low bend numbers. In F.J. Brandenburg, editor, Proc. Graph Drawing: Symp. on Graph Drawing (GD'95), volume 1027 of Lecture Notes in Comput. Sci., pages 254-266, Berlin, 1996. Springer.
15. U. Föβmeier and M. Kaufmann. Algorithms and area bounds for nonplanar orthogonal drawings. In Di Battista [5], pages 134-145.
16. S. North, editor. Proc. Graph Drawing: Symp. on Graph Drawing (GD'96), volume 1190 of Lecture Notes in Comput. Sci., Berlin, 1997. Springer.
17. A. Papakostas and I.G. Tollis. Orthogonal drawing of high degree graphs with small area and few bends. In F. Dehne, A. Rau-Chaplin, J.-R. Sack, and R. Tamassia, editors, Proc. Algorithms and Data Structures: 5th International Workshop (WADS'97), volume 1272 of Lecture Notes in Comput. Sci., pages 354-367, Berlin, 1997. Springer.
18. A. Papakostas and I.G. Tollis. Incremental orthogonal graph drawing in three dimensions. In Di Battista [5], pages 52-63.
19. R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421-443, June 1987.
20. S. Whitesides, editor. Proc. Graph Drawing: 6th International Symp. (GD'98), volume 1547 of Lecture Notes in Comput. Sci. Springer, 1998.
21. D.R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In Whitesides [20], pages 332-346.
22. D.R. Wood. Multi-dimensional orthogonal graph drawing in the general position model. Technical Report 99/38, School of Computer Science and Software Engineering, Monash University, Australia, 1999. (available at http://www.csse.monash.edu.au/publications/).
23. D.R. Wood. A new algorithm and open problems in three-dimensional orthogonal graph drawing. In R. Raman and J. Simpson, editors, Proc. Australasian Workshop on Combinatorial Algorithms (AWOCA'99), pages 157-167. Curtin University of Technology, Perth, 1999.