A split&push approach to 3D orthogonal drawing

Journal of Graph Algorithms and Applications

Volumn 4, Issue 3, 2000, Pages 105-133

  Di Battista, Giuseppe ^a   Patrignani, Maurizio ^a   Vargiu, Francesco ^b  

^a ROMA TRE UNIVERSITY   (Italy)

^b AIPA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

3D ORTHOGONAL; DEGREE SIX; EXPERIMENTAL COMPARISON; MAXIMUM DEGREE; ORTHOGONAL DRAWINGS; THREE DIMENSIONS;

EID: 0002568664     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00027     Document Type: Conference Paper

References (28)

1. H. Alt, M. Godau, and S. Whitesides. Universal 3-dimensional visibility representations for graphs. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 8-19. Springer-Verlag, 1996.
2. T. C. Biedl. Heuristics for 3d-orthogonal graph drawings. In Proc. 4th Twente Workshop on Graphs and Combinatorial Optimization, pages 41-44, 1995.
3. P. Bose, H. Everett, S. P. Fekete, A. Lubiw, H. Meijer, K. Romanik, T. Shermer, and S. Whitesides. On a visibility representation for graphs in three dimensions. In D. Avis and P. Bose, editors, Snapshots in Computational and Discrete Geometry, Volume III, pages 2-25. McGill University, July 1994. McGill technical report SOCS-94.50.
4. I. Bruß and A. Frick. Fast interactive 3-D graph visualization. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 99-110. Springer-Verlag, 1996.
5. R. F. Cohen, P. Eades, T. Lin, and F. Ruskey. Three-dimensional graph drawing. Algorithmica, 17:199-208, 1997.
6. I. F. Cruz and J. P. Twarog. 3d graph drawing with simulated annealing. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 162-165. Springer-Verlag, 1996.
7. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing. Prentice Hall, Upper Saddle River, NJ, 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. Theory Appl., 7:303-325, 1997.
9. D. Dodson. COMAIDE: Information visualization using cooperative 3D diagram layout. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 190-201. Springer-Verlag, 1996.
10. P. Eades, C. Stirk, and S. Whitesides. The techniques of Kolmogorov and Bardzin for three dimensional orthogonal graph drawings. Inform. Process. Lett., 60:97-103, 1996.
11. P. Eades, A. Symvonis, and S. Whitesides. Two algorithms for three dimensional orthogonal graph drawing. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 139-154. Springer-Verlag, 1997.
12. P. Eades, A. Symvonis, and S. Whitesides. Three-dimensional orthogonal graph drawing algorithms. Accepted for publication by Discrete Applied Math., as of February, 2000.
13. S. P. Fekete, M. E. Houle, and S. Whitesides. New results on a visibility representation of graphs in 3-d. In F. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 234-241. Springer-Verlag, 1996.
14. A. Frick, C. Keskin, and V. Vogelmann. Integration of declarative approaches. In S. North, editor, Graph Drawing (Proc. GD '96), volume 1190 of Lecture Notes Comput. Sci., pages 184-192. Springer-Verlag, 1997.
15. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York, NY, 1979.
16. A. Garg, R. Tamassia, and P. Vocca. Drawing with colors. In Proc. 4th Annu. European Sympos. Algorithms, volume 1136 of Lecture Notes Comput. Sci., pages 12-26. Springer-Verlag, 1996.
17. A. N. Kolmogorov and Y. M. Barzdin. Realization of nets in 3-dimensional space. Problems in Cybernetics, 8:261-268, 1967.
18. G. Liotta and G. Di Battista. Computing proximity drawings of trees in the 3-dimensional space. In Proc. 4th Workshop Algorithms Data Struct., volume 955 of Lecture Notes Comput. Sci., pages 239-250. Springer-Verlag, 1995.
19. B. Monien, F. Ramme, and H. Salmen. A parallel simulated annealing algorithm for generating 3D layouts of undirected graphs. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 396-408. Springer-Verlag, 1996.
20. D. I. Ostry. Some Three-Dimensional Graph Drawing Algorithms. M.Sc. thesis, Dept. Comput. Sci. and Soft. Eng., Univ. Newcastle, Oct. 1996.
21. J. Pach, T. Thiele, and G. Tóth. Three-dimensional grid drawings of graphs. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 47-51. Springer-Verlag, 1997.
22. A. Papakostas and I. G. Tollis. Incremental orthogonal graph drawing in three dimensions. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 52-63. Springer-Verlag, 1997.
23. M. Patrignani and M. Pizzonia. The complexity of the matching-cut problem. Tech. Report RT-DIA-35-1998, Dept. of Computer Sci., Univ. di Roma Tre, 1998.
24. M. Patrignani and F. Vargiu. 3DCube: A tool for three dimensional graph drawing. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes Comput. Sci., pages 284-290. Springer-Verlag, 1997.
25. A. Schrijver. Bipartite edge coloring in o(δm) time. SIAM J. on Computing, 28(3):841-846, 1998.
26. R. Webber and A. Scott. GOVE: Grammar-Oriented Visualisation Environment. In F. J. Brandenburg, editor, Graph Drawing (Proc. GD '95), volume 1027 of Lecture Notes Comput. Sci., pages 516-519. Springer-Verlag, 1996.
27. D. R. Wood. An algorithm for three-dimensional orthogonal graph drawing. In S. H. Whitesides, editor, Graph Drawing (Proc. GD '98), volume 1547 of Lecture Notes Comput. Sci., pages 332-346. Springer-Verlag, 1998.
28. D. R. Wood. Two-bend three-dimensional orthogonal grid drawing of maximum degree five graphs. Technical Report 98/03, School of Computer Science and Software Engineering, Monash University, 1998.