A fast heuristic for hierarchical Manhattan layout

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

Volumn 1027, Issue , 1996, Pages 447-458

  Sander, G ^a  

^a SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS);

EDGE ORIENTATIONS; HORIZONTAL SEGMENTS; LAYOUT METHODS; MANHATTAN LAYOUT; MANHATTANS; ORIGINAL ALGORITHMS;

DIRECTED GRAPHS;

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

References (16)

1. Baker, B.S.; Bhatt, S.N.; Leighton, F.T.: An Approximation Algorithm for Manhattan Routing, in Preparata, F.P., ed.: Advances in Computing Research, Vol. 2, pp. 205-229, JAI Press, Greenwich, Connecticut, 1984.
2. Batini, C.; Nardelli, E.; Tamassia, R.: A Layout Algorithm for Data Flow Diagrams, IEEE Trans, on Software Engineering, SE-12(4), pp. 538-546, 1986
3. Bhatt, S.N.; Cosmadakis, S.S.: The Complexity of Minimizing Wire Lengths in VLSI Layouts, Information Processing Letters, 25, pp. 263-267, 1987.
4. Biedl, T.; Kant, G.: A Better Heuristic for Orthogonal Graph Drawings, Technical Report UU-CS-1995-04, Utrecht University, 1995, also inProc. 2nd Ann. European Symposium on Algorithms (ESA'94), LNCS 855, pp. 24-35, Springer-Verlag, 1994.
5. Even, S.; Granot, G.: Grid Layouts of Block Diagrams - Bounding the Number of Bends in Each Connection, inTamassia, R.; Tollis, I.G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD'94, LNCS 894, pp. 64-75, Springer-Verlag, 1995.
6. Gansner, E.R.; Koutsofios, E.; North, S.C.; Vo, K.-P.: A Technique for Drawing Directed Graphs, IEEE Trans, on Software Engineering, 19(3), pp. 214-230, 1993.
7. Himsolt, M.: GraphEd - A Graphical Platform for the Implementation of Graph Algorithms, inTamassia, R.; Tollis, I.G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD'94, LNCS 894, pp. 182-193, Springer-Verlag, 1995.
8. Johnson, D.: The NP-completeness column: An ongoing guide, Journal on Algorithms, 3(1), pp. 215-218, 1982
9. Protsko, L.B.; Sorenson, P.G.; Tremblay, J.P.; Scharfer, D.A.: Towards the Automatic Generation of Software Diagrams, IEEE Trans, on Software Engeneering, 17(1), pp. 10-21, 1991
10. Sander, G.: Graph Layout Through the VCG Tool, inTamassia, R.; Tollis, I. G., eds.: Graph Drawing, Proc. DIMACS Intern. Workshop GD'94, LNCS 894, pp. 194-205, Springer-Verlag, 1995. The VCG tool is publicly available via http://www.es.uni-sb.de:80/RW/users/sander/html/gsvcgl.html.
11. Sugiyama, K., Tagawa, S., Toda, M.: Methods for Visual Understanding of Hierarchical Systems, IEEE Trans. Sys., Man, and Cybernetics, SMC 11(2), pp. 109-125, 1981.
12. Tamassia, R.: On Embedding a Graph in the Grid with the Minimum Number of Bends, SIAM Journal of Computing, 16(3), pp. 421-444, 1987.
13. Tamassia, R., Tollis, I.G.: Planar Grid Embedding in Linear Time, IEEE Trans, on Circuits and Systems, 36(9), pp. 1230-1234, 1989.
14. Vijayan G.; Wigderson A.: Rectilinear Graphs and Their Embeddings, SIAM Journal of Computing, 14(2), pp. 355-372, 1985.
15. Warfield, N.J.: Crossing Theory and Hierarchy Mapping, IEEE Trans. Sys., Man, and Cybernetics, SMC 7(7), pp. 505-523, 1977.
16. Wieners-Lummer, C.: Manhattan Channel Routing with Good Theoretical and Practical Performance, ACM SIAM Symp. on Disc. Alg., pp. 465-474, 1990.