Drawing high degree graphs with low bend numbers

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

Volumn 1027, Issue , 1996, Pages 254-266

  Fößmeier, Ulrich ^a   Kaufmann, Michael ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEGREE GRAPHS; NP-HARD; PLANE GRAPHS; VERTEX DEGREE;

DRAWING (GRAPHICS);

EID: 84947909727     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0021809     Document Type: Conference Paper

References (17)

1. Batini, C., E. Nardelli, and R. Tamassia, A Layout Algorithm for Data-Flow Diagrams, IEEE Trans, on Software Engineering, Vol. SE-12 (4), pp. 538-546, 1986.
2. Batini, C., M. Talamo, and R. Tamassia, Computer Aided Layout Of Entity-Relationship Diagrams, The Journal of Systems and Software, Vol. 4, pp. 163-173, 1984.
3. H.K.B. Beck, H.-P. Galil, R. Henkel, and E. Sedlmayr:Chemistry incircumstellar shells, I. Chromospheric radiation fields and dust formation inoptimcally thin shells of M- giants, Astron. Astrophys. 265 (1992) 626-642.
4. Di Battista G., P. Eades, R. Tamassia and I.G. Tollis,Algorithms for Automatic Graph Drawing: An Annotated Bibliography, Tech.Rep., Dept.of Comp.Sc., Brown Univ., 1993.
5. Di Battista, E. Pietrosanti, R. Tamassia and I.G. Tollis,Automatic Layout of PERT Diagrams with XPERT, Proc. IEEE Workshop on Visual Lang. (VL'89), 171-176, 1989.
6. Di Battista, G., L. Vismara,Angles of Planar Triangular Graphs, Proc. of the 25th ACM Symposium on the Theory of Computing, San Diego, California, 1993.
7. Fößmeier, U., and M. Kaufmann,Drawing High Degree Graphs with Low Bend Numbers, Technical Report WSI-95-21, Univ. Tübingen 1995.
8. Garg, A. and R. Tamassia,On the Computational Complexity of Upward and Rectilinear Planarity Testing, Proc. of GD '94, Princeton, 1994.
9. Himsolt, M.,Konzeption und Implementierung von Grapheneditoren, Doctoral Dissertation, Passau 1993.
10. Lengauer, T.,Combinatorial Algorithms for Integrated Circuit Layout, Teubner/WileySc Sons, Stuttgart/Chichester, 1990.
11. Mutzel, P.,The Maximum Planar Subgraph Problem, Doctoral Dissertation, Köln 1994.
12. Reiner, D., et al.,A Database Designer's Workbench in Entity-Relationship Approach, ed. S. Spaccapietra, pp. 347-360, North-Holland, 1987.
13. Rosenstiehl, P., and R.E. Tarjan, Rectilinear planar layouts and bipolar orientations of planar graphs,Discrete and Comp. Geometry 1 (1986), pp. 343-353.
14. Protsko, L.B., P.G. Sorenson, J.P. Tremblay, and D.A. Schaefer,Towards the Automatic Generation of Software Diagrams, IEEE Trans, on Software Engineering, Vol. SE-17 (1), pp. 10-21, 1991.
15. Storer, J.A.,The node cost measure for embedding graphs inthe planar gnd, Proc. 12th ACM Symposium on the Theory of Computing, 1980, pp. 201-210.
16. Tamassia, R.,On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM Journal of Computing, vol. 16, no. 3, 421 - 444, 1987.
17. Tamassia, R., and I.G. Tollis,A unified approach to visibility representations of planar graphs, Discr. and Comp. Geometry 1 (1986), pp. 321-341.