A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs
Hong, Seok-Hee and Eades, Peter (2004) A Linear Time Algorithm for Constructing Maximally Symmetric Straight-Line Drawings of Planar Graphs. In: Graph Drawing 12th International Symposium, GD 2004, September 29-October 2, 2004, New York, NY, USA , pp. 307-317 (Official URL: http://dx.doi.org/10.1007/978-3-540-31843-9_31).
Full text not available from this repository.
This paper presents a linear time algorithm for constructing maximally symmetric straight-line drawings of biconnected and one-connected planar graphs. This research was partially supported by a grant from the Australian Research Council. For the full version of this paper, see [7,8]. National ICT Australia is funded by the Australian Governmentrsquos Backing Australiarsquos Ability initiative, in part through the Australian Research Council.
Repository Staff Only: item control page