Skip to Main 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
18.3. GRAPH-CLASSES AND THEIR HIERARCHY 581
(a) (b)
Figure 18.9 (a) Drawing dug1 and (b) drawing dug2, computed with the code of Fig-
ure 18.8. The two drawings have the same shape but different geometry. The drawing in
(b) is much more compact, both in terms of area and in terms of total edge length.
drawings in Figures 18.10 (a)-(b) are obtained by executing a linear-time drawing algorithm,
while the drawings in Figures 18.10 (c)-(d) are obtained by applying an O(n
2
log n)-time
compaction algorithm that reduces the total edge length.
(a) (b) (c) (d)
Figure 18.10 Two visibility drawings and two polyline drawings of the same embedded
planar graph. The
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