Drawing Planar Graphs with Circular Arcs

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

Volumn 1731, Issue , 1999, Pages 117-126

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

^a JOHNS HOPKINS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); GRAPHIC METHODS;

ANGULAR RESOLUTION; CIRCULAR ARC; LOWER BOUNDS; PLANAR GRAPH; SMALL AREA; STRAIGHT-LINE SEGMENTS;

GRAPH THEORY;

EID: 84958980832     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-46648-7_12     Document Type: Conference Paper

References (14)

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. Inform. Process. Lett., 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. Fary. On straight lines representation of planar graphs. Acta Sci. Math. Szeged, 11:229-233, 1948.
5. M. Formann, T. Hagerup, J. Haralambides, M. Kaufmann, F. T. Leighton, A. Simvonis, Emo Welzl, and G. Woeginger. Drawing graphs in the plane with high resolution. SIAM J. Comput., 22:1035-1052, 1993.
6. A. Garg and R. Tamassia. Planar drawings and angular resolution: Algorithms and bounds. In Proc. 2nd Annu. European Sympos. Algorithms, volume 855 of Lecture Notes Comput. Sci., pages 12-23. Springer-Verlag, 1994.
7. M. T. Goodrich and C. G. Wagner. A framework for drawing planar graphs with curves and polylines. In Graph Drawing '98, pages 153-166, 1998.
8. C. Gutwenger and P. Mutzel. Planar polyline drawings with good angular resolution. In Graph Drawing '98, pages 167-182, 1998.
9. G. Kant. Drawing planar graphs using the lmcordering. In Proc. 33th Annu. IEEE Sympos. Found. Comput. Sci., pages 101-110, 1992.
10. 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).
11. S. Malitz and A. Papakostas. On the angular resolution of planar graphs. SIAM J. Discrete Math., 7:172-183, 1994.
12. W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138-148, 1990.
13. W. T. Tutte. How to draw a graph. Proceedings London Mathematical Society, 13(52):743-768, 1963.
14. K. Wagner. Bemerkungen zum vierfarbenproblem. Jahresbericht der Deutschen Mathematiker-Vereinigung, 46:26-32, 1936.