One-processor scheduling with symmetric earliness and tardiness penalties
Mathematics of Operations Research
SIAM Journal on Computing
Sequencing with earliness and tardiness penalties: a review
Operations Research
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Polygon labelling of minimum leader length
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
Algorithms for multi-criteria one-sided boundary labeling
GD'07 Proceedings of the 15th international conference on Graph drawing
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
| Hi-index | 0.00 |
A major factor affecting the readability of an illustration that contains textual labels is the degree to which the labels obscure graphical features of the illustration as a result of spatial overlaps. Boundary labeling addresses this problem by attaching the labels to the boundary of a rectangle that contains all features. Then, each feature should be connected to its associated label through a polygonal line, called leader, such that no two leaders intersect.In this paper we study the boundary labeling problem along a new line of research, according to which different pairs of type leaders (i.e. doand pd, odand pd) are combined to produce boundary labelings. Thus, we are able to overcome the problem that there might be no feasible solution when labels are placed on different sides and only one type of leaders is allowed. Our main contribution is a new algorithm for solving the total leader length minimization problem (i.e., the problem of finding a crossing free boundary labeling, such that the total leader length is minimized) assuming labels of uniform size. We also present an NP-completeness result for the case where the labels are of arbitrary size.