One-processor scheduling with symmetric earliness and tardiness penalties
Mathematics of Operations Research
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Approximate map labeling is in &OHgr;(n log n)
Information Processing Letters
Map labeling heuristics: provably good and practically useful
Proceedings of the eleventh annual symposium on Computational geometry
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
Boundary Labeling in Text Annotation
IV '09 Proceedings of the 2009 13th International Conference Information Visualisation
Boundary Labeling with Octilinear Leaders
Algorithmica - Special Issue: Scandinavian Workshop on Algorithm Theory; Guest Editor: Joachim Gudmundsson
Algorithms for multi-criteria one-sided boundary labeling
GD'07 Proceedings of the 15th international conference on Graph drawing
Area-Feature Boundary Labeling1
The Computer Journal
| Hi-index | 0.00 |
In boundary labeling, each point site in a rectangular map is connected to a label outside the map by a leader, which may be a rectilinear or a straight-line segment. Among various types of leaders, the so-called type-opo leader consists of three segments (from the site to its associated label) that are orthogonal, then parallel, and then orthogonal to the side to which the label is attached. In this paper, we investigate the so-called 1.5-side boundary labeling, in which, in addition to being connected to the right side of the map directly, type-opo leaders can be routed to the left side temporarily and then finally to the right side. It turns out that allowing type-opo leaders to utilize the left side of a map is beneficial in the sense that it produces a better labeling result in some cases. To understand this new version of boundary labeling better, we investigate from a computational complexity viewpoint the total leader length minimization problem as well as the bend minimization problem for variants of 1.5-side boundary labeling, which are parameterized by the underlying label size (uniform vs. nonuniform) and port type (fixed-ratio, fixed-position, vs. sliding). For the case of nonuniform labels, the above two problems are intractable in general. We are able to devise pseudopolynomial time solutions for such intractable problems, and also identify the role played by the number of distinct labels in the overall complexity. On the other hand, if labels are identical in size, both problems become solvable in polynomial time. We also characterize the cases for which utilizing the left side for routing type-opo leaders does not help.