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
180 CHAPTER 5. TREE DRAWING ALGORITHMS
Figure 5.19 Layout of the ringed circular layout algorithm of [TM02]. The four larger
rings represent the largest children of the parent node, and the inner ring represents the
area left for the rest of the children.
Figure 5.20 Rotation strategy to decrease occlusion. Figure taken from [TM02].
In order to allow for real-time interaction, a top-down variation of the Rings algorithm,
called FastRings [RSJ07], trade s space for time. In FastRings, all nodes of t he tree are
considered to be equivalent and assigned same size circles . This allows the algorithm to
start drawing the tree much so one r , when only
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