Skip to main content
Article thumbnail
Location of Repository

A linear time algorithm for constructing maximally symmetric straight-line drawings of planar graphs

By Seok-hee Hong, Brendan Mckay and Peter Eades

Abstract

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

Topics: Graph drawing, Symmetry, Planar graphs, Planar geometric automorphism
Year: 2005
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.7167
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.usyd.edu.au/~shh... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.