Overloaded orthogonal drawings

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

Volumn 7034 LNCS, Issue , 2012, Pages 242-253

  Kornaropoulos, Evgenios M ^a,b   Tollis, Ioannis G ^a,b  

^a UNIVERSITY OF CRETE   (Greece)

^b INSTITUTE OF COMPUTER SCIENCE   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

DIRECTED ACYCLIC GRAPHS; GRAPH VISUALIZATION; GRID POINTS; ORTHOGONAL DRAWINGS; OVERLOADING TECHNIQUES; UNDIRECTED GRAPH; VERTEX COORDINATES; DIRECTED ACYCLIC GRAPH (DAG); WEAK DOMINANCES;

VISUALIZATION; DRAWING (GRAPHICS);

DRAWING (GRAPHICS); DIRECTED GRAPHS;

EID: 84455182343     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-25878-7_24     Document Type: Conference Paper

References (21)

1. Bertolazzi, P., Di Battista, G., Didimo, W.: Computing orthogonal drawings with the minimum number of bends. IEEE Transactions on Computers 49(8), 826-840 (2000)
2. Biedl, T., Kant, G.: A better heuristic for orthogonal graph drawings. Computational Geometry: Theory and Applications 9(3), 159-180 (1998) (Pubitemid 128378353)
3. Biedl, T.C., Madden, B.P., Tollis, I.G.: The Three-Phase Method: A Unified Approach to Orthogonal Graph Drawing. Int. J. Comput. Geometry Appl. 10(6), 553-580 (2000) (Pubitemid 33218696)
4. Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of graphs. Prentice - Hall, New Jersey (1998)
5. Di Battista, G., Tamassia, R., Tollis, I.G.: Area Requirement and Symmetry Display of Planar Upward Drawings. Discrete and Comput. Geom. 7(4), 381-401 (1992)
6. Dickerson, M., Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent Drawings: Vizualizing Non-planar Diagrams in a Planar Way. Journal of Graph Algorithms and Applications 9(1), 31-52 (2005) (Pubitemid 41597150)
7. Eppstein, D., Goodrich, M.T., Meng, J.Y.: Confluent Layered Drawings. Algorithmica 47(4), 439-452 (2007) (Pubitemid 46479913)
8. Even, S., Tarjan, R.: Computing an stnumbering. Theoretical Computer Science 2(3), 339-344 (1976)
9. Fößmeier, U., Kaufmann, M.: Algorithms and Area Bounds for Nonplanar Orthogonal Drawings. In: DiBattista, G. (ed.) GD 1997. LNCS, vol. 1353, pp. 134-145. Springer, Heidelberg (1997) (Pubitemid 128012900)
10. Kornaropoulos, E.M., Tollis, I.G.: Weak Dominance Drawings and Linear Extension Diameter, arXiv:1108.1439 (2011)
11. Lengauer, T.: Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, Inc., New York (1990)
12. Nomura, K., Tayu, S., Ueno, S.: On the Orthogonal Drawing of Outerplanar Graphs. Journal IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E88-A(6), 1583-1588 (2005) (Pubitemid 41389488)
13. Papakostas, A., Tollis, I.G.: Efficient Orthogonal Drawings of High Degree Graphs. Algorithmica 26(1), 100-125 (2000)
14. Papakostas, A., Tollis, I.G.: Algorithms for Area-Efficient Orthogonal Drawings. Computational Geometry Theory and Applications 9(1-2), 83-110 (1998) (Pubitemid 128378349)
15. Papamanthou, C., Tollis, I.G.: Algorithms for computing a parameterized st-orientation. Theoretical Computer Science 408(2-3), 224-240 (2008)
16. Papamanthou, C., Tollis, I.G.: Applications of Parameterized st-Orientations. Journal of Graph Algorithms and Applications 14(2), 337-365 (2010)
17. Rahman, S., Nishizeki, T., Naznin, M.: Orthogonal Drawings of Plane Graphs Without Bends. Journal of Graph Algorithms and Applications 7(4), 335-362 (2003)
18. Storer, J.: On minimal node-cost planar embeddings. Networks 14(2), 181-212 (1984)
19. Tamassia, R.: On embedding a graph in the grid with the minimum number of bends. SIAM J. Computing 16(3), 421-444 (1987) (Pubitemid 17583644)
20. Tamassia, R., Tollis, I.G.: Planar Grid Embeddings in Linear Time. IEEE Transactions on Circuits and Systems 36(9), 1230-1234 (1989) (Pubitemid 20617558)
21. Vismara, L., Di Battista, G., Garg, A., Liotta, G., Tamassia, R., Vargiu, F.: Experimental studies on graph drawing algorithms. Software: Practice and Experience 30(11), 1235-1284 (2000)