A Framework for Drawing Planar Graphs with Curves and Polylines

Journal of Algorithms

Volumn 37, Issue 2, 2000, Pages 399-421

  Goodrich, Michael T ^a   Wagner, Christopher G ^b  

^a Johns Hopkins University   (United States)

^b JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347370175     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.2000.1115     Document Type: Article

References (14)

1. T. M. Chan, M. T. Goodrich, S. R. Kosaraju, and R. Tamassia, Optimizing area and aspect ratio in straight-line orthogonal tree drawings, in "Graph Drawing (Proc. GD '96)," (S. North, Ed.), Lecture Notes Comput. Sci., Vol. 1190, pp. 63-75, Springer-Verlag, Berlin/New York, 1997.
2. M. Chrobak and T. Payne, A linear-time algorithm for drawing planar graphs, Inform. Process. Lett. 54 (1995), 241-246.
3. H. de Fraysseix, J. Pach, R. Pollack, How to draw a planar graph on a grid, Combinatorica 10 (1990), 41-51.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis, Algorithms for drawing graphs: an annotated bibliography, Comput. Geom. Theory Appl. 4 (1994), 235-282.
5. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, E. Welzl, and G. Woeginger, Drawing graphs in the plane with high resolution, SIAM J. Comput. 22 (1993), 1035-1052.
6. E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo, A technique for drawing directed graphs, IEEE Trans. Software Eng. 19 (1993), 214-230.
7. A. Garg and R. Tamassia, Planar drawings and angular resolution: Algorithms and bounds, in "Proc. 2nd Annu. European Sympos. Algorithms," Lecture Notes in Computer Science, Vol. 855, pp. 12-23, Springer-Verlag, Berlin/New York, 1994.
8. J. Hopcroft and R. E. Tarjan, Efficient planarity testing, J. Assoc. Comput. Mach. 21 (1974), 549-568.
9. G. Kant, "Algorithms for Drawing Planar Graphs," Ph.D. thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, Netherlands, 1993.
10. G. Kant, Drawing planar graphs using the canonical ordering, Algorithmica 16 (1996), 4-32. 1996. [Special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia]
11. S. Malitz and A. Papakostas, On the angular resolution of planar graphs, SIAM J. Discrete Math. 7 (1994), 172-183.
12. W. Schnyder, Embedding planar graphs on the grid, in "Proc. 1st ACM-SIAM Sympos. Discrete Algorithms," pp. 138-148, 1990.
13. R. Tamassia, On embedding a graph in the grid with the minimum number of bends, SIAM J. Comput. 16 (1987), 421-444.
14. R. Tamassia, Graph drawing, in "Handbook of Discrete and Computational Geometry," (J. E. Goodman and J. O'Rourke, Eds.), Chap. 44, pp. 815-832, CRC Press, Boca Raton, FL, 1997.