Seok-Hee Hong
ABSTRACT
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we need two steps. The first step is to find appropriate automorphisms. The second step is to draw the graph to display the automorphisms. Our aim in this paper is to construct maximally symmetric straight-line drawings of triconnected planar graphs in linear time. Previously known algorithms run in quadratic time. We show that an algorithm of Fontet can be used to find an embedding in the plane with the maximum number of symmetries, and present a new algorithm for finding a straight line drawing that achieves that maximum. Both algorithms run in linear time.
- Symmetric drawings of triconnected planar graphs
Recommendations
A Linear-Time Algorithm for Symmetric Convex Drawings of Internally Triconnected Plane Graphs
Symmetry is one of the most important aesthetic criteria in Graph Drawing which can reveal the hidden structure in the graph. Convex drawing is a straight-line drawing where every facial cycle is drawn as a convex polygon.
In this paper, we prove that ...
Small Drawings of Outerplanar Graphs, Series-Parallel Graphs, and Other Planar Graphs
In this paper, we study small planar drawings of planar graphs. For arbitrary planar graphs, ź(n2) is the established upper and lower bound on the worst-case area. A long-standing open problem is to determine for what graphs a smaller area can be ...
Area-efficient planar straight-line drawings of outerplanar graphs
It is important to minimize the area of a drawing of a graph, so that the drawing can fit in a small drawing-space. It is well-known that a planar graph with n vertices admits a planar straight-line grid drawing with O(n^2) area [H. de Fraysseix, J. ...
Comments