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
300 CHAPTER 9. CIRCULAR DRAWING ALGORITHMS
in the parent biconnected component in the block-cutpoint tree. Likewise, define descendant
nodes to be adjacent to nodes in child biconnec ted components. In order to reduce the
number of crossings caused by inter-biconnected component edges, the technique tries to
place ancestor nodes in the arc between the points α and β. The size of the arc from α to
β is dependent on the distance between the placement of a biconnected component to the
placement of its parent in the radial layout of the block-cutpoint tree. Descendant nodes
are placed uniformly in the bottom half of the biconnected component layout. F
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