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 ...