A Framework for Drawing Planar Graphs with Curves and Polylines

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 nvertex planar graph in an O(n)

• Type: Conference
• Year: 1998
• Where: GD
• Authors: Michael T. Goodrich, Christopher G. Wagner
• Keywords: Complexity Measures, Computer Graphics, Edge, GD 1998, Planar Graph