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
586 CHAPTER 18. GDTOOLKIT
The first type of constraint imposes that an edge e is not allowed to cross any other edge.
If edge e is split into two edges e
1
and e
2
, the constraint is propagated on both e
1
and e
2
.
Symmetrically, if an edge e is obtained by merging two edges e
1
, e
2
, and at least one of
them is not crossable, then e will become not crossable too. If the planarization algorithm
encounters an edge e that is not crossable, it omits to insert its dual edge in the dual graph
of the planar embedded graph computed so far. This implies that a shortest path in the
dual graph never intersects e.
The second type of constraint imposes that a specified
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