A linear time algorithm for constructing maximally symetric straight line drawings of triconnected planar graphs
Symmetry is one of the most important aesthetic criteria in graph drawing because it reveals structure in the graph. To draw graphs symmetrically, we employ 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...[Show more]
|Collections||ANU Research Publications|
|Source:||Discrete and Computational Geometry|
|01_Hong_A_linear_time_algorithm_for_2006.pdf||1.04 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.