Advertisement

A Framework for Drawing Planar Graphs with Curves and Polylines

  • Michael T. Goodrich
  • Christopher G. Wagner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1547)

Abstract

We describe a unified framework of aesthetic criteria and complexity measures for drawing planar graphs with polylines and curves. This framework includes several visual properties of such drawings, including aspect ratio, vertex resolution, edge length, edge separation, and edge curvature, as well as complexity measures such as vertex and edge representational complexity and the area of the drawing. In addition to this general framework, we present algorithms that operate within this framework. Specifically, we describe an algorithm for drawing any n- vertex planar graph in an O(n) × O(n) grid using polylines that have at most two bends per edge and asymptotically-optimal worst-case angular resolution. More significantly, we show how to adapt this algorithm to draw any n-vertex planar graph using cubic Bézier curves, with all vertices and control points placed within an O(n) × O(n) integer grid so that the curved edges achieve a curvilinear analogue of good angular resolution. All of our algorithms run in O(n) time.

Keywords

Control Point Planar Graph Angular Resolution Curve Edge Graph Drawing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. [1]
    T. Chan, M. T. Goodrich, S. R. Kosaraju, and R. Tamassia. Optimizing area and aspect ratio in straight-line orthogonal tree drawings. In S. North, editor, Graph Drawing (Proc. GD’ 96, volume 1190 of Lecture Notes Comput. Sci., pages 63–75. Springer-Verlag, 1997.Google Scholar
  2. [2]
    M. Chrobak and T. Payne. A linear-time algorithm for drawing planar graphs. Inform. Process. Lett., 54:241–246, 1995.zbMATHCrossRefMathSciNetGoogle Scholar
  3. [3]
    H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10:41–51, 1990.zbMATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235–282, 1994.zbMATHGoogle Scholar
  5. [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:1035–1052, 1993.zbMATHCrossRefMathSciNetGoogle Scholar
  6. [6]
    E. R. Gansner, E. Koutsofios, S. C. North, and K. P. Vo. A technique for drawing directed graphs. IEEE Trans. Softw. Eng., 19:214–230, 1993.CrossRefGoogle Scholar
  7. [7]
    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.Google Scholar
  8. [8]
    J. Hopcroft and R. E. Tarjan. Efficient planarity testing. J. A CM, 21(4):549–568, 1974.zbMATHMathSciNetGoogle Scholar
  9. [9]
    G. Kant. Algorithms for Drawing Planar Graphs. PhD thesis, Dept. Comput. Sci., Univ. Utrecht, Utrecht, Netherlands, 1993.Google Scholar
  10. [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).Google Scholar
  11. [11]
    S. Malitz and A. Papakostas. On the angular resolution of planar graphs. SIAM J. Discrete Math., 7:172–183, 1994.zbMATHCrossRefMathSciNetGoogle Scholar
  12. [12]
    W. Schnyder. Embedding planar graphs on the grid. In Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pages 138–148, 1990.Google Scholar
  13. [13]
    R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421–444, 1987.zbMATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    R. Tamassia. Graph drawing. In J. E. Goodman and J. O’Rourke, editors, Handbook of Discrete and Computational Geometry, chapter 44, pages 815–832. CRC Press LLC, Boca Raton, FL, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Michael T. Goodrich
    • 1
  • Christopher G. Wagner
    • 1
  1. 1.The Johns Hopkins UniversityUSA

Personalised recommendations