Skip navigation
Skip navigation

A linear time algorithm for constructing maximally symetric straight line drawings of triconnected planar graphs

Hong, Seok-Hee; McKay, Brendan; Eades, Peter

Description

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]

CollectionsANU Research Publications
Date published: 2006
Type: Journal article
URI: http://hdl.handle.net/1885/34620
Source: Discrete and Computational Geometry
DOI: 10.1007/s00454-006-1231-5

Download

File Description SizeFormat Image
01_Hong_A_linear_time_algorithm_for_2006.pdf1.04 MBAdobe PDF    Request a copy


Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  20 July 2017/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator