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
494 CHAPTER 15. LABELING ALGORITHMS
A practical matching algorithm for the GFLP problem
The placement of labels is a post-layout operation (i.e., performed on a fixed geometry
of nodes and edges). The basic idea behind this labeling technique is the following: a
set of discrete potential label solutions for each object is carefully selected. This set of
labels is reduced by removing heavily overlapping labels. F i nally, an assignment of labels
is performed by s olvin g a variant of t he matching problem. This method is shown in
Figure 15.3. An example of the resulting label placement is given in Figure 15.4.
Basic Labeling Algorith m
INPUT: A drawing ...
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