Algorithms and area bounds for nonplanar orthogonal drawings

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

Volumn 1353, Issue , 1997, Pages 134-145

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

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

NETWORK FLOW PROBLEMS; ORTHOGONAL DRAWINGS; UNIFORM SIZE;

ALGORITHMS;

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

References (15)

1. Bertolazzi, P., G. Di Battista, W. Didimo, Computing Orthogonal Drawings with the Minimum Number of Bends, Proc. of WADS’97, to appear.
2. Biedl, T.C., Orthogonal Graph Drawing, Algorithms and Lower Bounds, Diplomarbeit TU Berlin, 1995.
3. Biedl, T.C., M. Kaufmann, Area-Efficient Static and Incremental Drawings of High. Degree Graphs. to appear in ESA 1997.
4. Di Battista, G., P. Eades, R. Tamassia, I.G. Tollis, Algorithms for Drawing Graphs: An Annotated Bibliography, Computational Geometry: Theory & Applications, 235-282, 1994.
5. Di Battista, G., A. Garg, G. Liotta, R. Tamassia, E. Tassinari, F. Vargiu, An Experimental Comparison of Three Graph Drawing Algorithms, Computational Geometry: Theory & Applications, 1996.
6. CPLEX optimization, Inc., Using the CPLEX Base System.
7. Eades, P., J. Marks, Graph-Drawing Contest Report, Proceedings on GD’94, Princeton, LNCS 894, 143-146, 1995.
8. Fößmeier U., M. Kaufmann, Drawing High Degree Graphs with Low Bend Numbers, Proceedings on GD’95, Passau, LNCS 1027, 254-266, 1995.
9. Fößmeier U., G. Kant, M. Kaufmann, 2-Visibility Drawings of Planar Graphs, Proceedings on GD’96, Berkeley, LNCS 1190, 155-168, 1996.
10. Garey, M.R., D.S. Johnson, Computers and Intractability: A Guide to the Theory of.NP-Completeness, W.H. Freeman and Company, New York, 1979.
11. Kleinschmidt P., personal communication.
12. Lawler, E.L., Combinatorial Optimization: Networks and Matroids, Holt, Rinehart and Winston, New York, 1976, Chapter 4.
13. Papakostas A., I.G. Toms, High-degree orthogonal drawings with small grid-size and few bends. Technical report, University of Texas at Dalls, Richardson, TX 75083, December 1996.
14. 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.
15. Tamassia, R., G. Di Battista, C. Batini, Automatic Graph Drawing and Readability of Diagrams, IEEE Trans. Systems, Man and Cybernetics, 61-79, 1988.