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
504 CHAPTER 15. LABELING ALGORITHMS
15.3.4 The MLP Prob l em
Many algorithms exist for the labeling problem; however, very lit tl e work has been directed
toward positioning many labels per graphical feature in a map or drawing [FA87, Fre88,
KT06]. This problem is known as the Mul tip le Label Placement (MLP) problem.
In existing automated name placement systems for geographic maps s imp le techniques
have been utilized to address the MLP problem [FA87, Fre88]. Specifically, each feature to
be labeled is partitioned into as many pieces as the number of labels for th at feature. Then,
labeling algorithms for single label per graphical feature may be applied to the new set of
partitioned graphical features. In many applications , this straightforward ...
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