Skip to Content
Handbook of Graph Drawing and Visualization
book

Handbook of Graph Drawing and Visualization

by Roberto Tamassia
August 2013
Intermediate to advanced content levelIntermediate to advanced
862 pages
32h 20m
English
Chapman and Hall/CRC
Content preview from Handbook of Graph Drawing and Visualization
3.5. SYMMETRIC DRAWINGS OF PLANAR GRAPHS 107
Figure 3.15 Di s pl ay of two maximal planar automorphism groups.
This means that additional maximal planar automorphism groups only add a constant
to the time complexity of the algorithms.
3.5.5 Drawing algorithms
The algorithms presented in the preceding sections take a planar graph as input and produce
two outputs : a planar automorphism group of maximum size, and an embedding of the
graph. In this section, we show how to use this information to const r u ct a straight-line
symmetric drawing of the graph. The drawing algorithms follow the same connectivity
hierarchy.
For triconnected graphs, one could
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Handbook of Graph Theory, 2nd Edition

Handbook of Graph Theory, 2nd Edition

Jonathan L. Gross, Jay Yellen, Ping Zhang
Drawing Product Ideas

Drawing Product Ideas

Kent E. Eisenhuth, Manuel Lima

Publisher Resources

ISBN: 9781420010268