Drawing planar graphs with circular arcs

Discrete and Computational Geometry

Volumn 25, Issue 3, 2001, Pages 405-418

  Cheng, C C ^a   Duncan, C A ^b   Goodrich, M T ^c   Kobourov, S G ^d  

^a JOHNS HOPKINS UNIVERSITY   (United States)

^b Department of Computer Science and Center for Computational Science   (United States)

^c Johns Hopkins University   (United States)

^d University of Arizona   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035590704     PISSN: 01795376     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004540010080     Document Type: Article

References (15)

1. G. Di Battista, P. Eades, R. Tamassia, and I. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, Englewood Cliffs, NJ, 1999.
2. M. Chrobak and T. Payne. A linear-time algorithm for drawing planar graphs. Information Processing Letters, 54:241-246, 1995.
3. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
4. I. Fáry. On straight lines representation of planar graphs. Acta Scientiarum Mathematicarum, 11:229-233, 1948.
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 Journal of Computing, 22:1035-1052, 1993.
6. A. Garg and R. Tamassia. Planar drawings and angular resolution: algorithms and bounds. In Proceedings of the 2nd Annual European Symposium on Algorithms, pages 12-23, 1994.
7. M. T. Goodrich and C. G. Wagner. A framework for drawing planar graphs with curves and polylines. In Proceedings of the 6th Annual Symposium on Graph Drawing, pages 153-166, 1998.
8. C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In Proceedings of the 6th Annual Symposium on Graph Drawing, pages 167-182, 1998.
9. G. Kant. Drawing planar graphs using the lmc-ordering. In Proceedings of the 33rd Annual IEEE Symposium on Foundations of Computer Science, pages 101-110, 1992.
10. G. Kant. Algorithms for Drawing Planar Graphs. Ph.D. thesis, Department of Computer Science, University of Utrecht, Utrecht, 1993.
11. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996 (special issue on Graph Drawing, edited by G. Di Battista and R. Tamassia).
12. S. Malitz and A. Papakostas. On the angular resolution of planar graphs. SIAM Journal of Discrete Mathematics, 7:172-183, 1994.
13. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 138-148, 1990.
14. W. T. Tutte. How to draw a graph. Proceedings of the London Mathematical Society, 13(52):743-768, 1963.
15. K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26-32, 1936.