A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Point set labeling with specified positions
Proceedings of the sixteenth annual symposium on Computational geometry
Schematization of road networks
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Elastic Labels Around the Perimeter of a Map
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
Graphical features on map, charts, diagrams and graph drawings usually must be annotated with text labels in order to convey their meaning. In this paper we focus on a problem that arises when labeling schematized maps, e.g. for subway networks. We present algorithms for labeling points on a line with axis-parallel rectangular labels of equal height. Our aim is to maximize label size under the constraint that all points must be labeled. Even a seemingly strong simplification of the general point-labeling problem, namely to decide whether a set of points on a horizontal line can be labeled with sliding rectangular labels, turns out to be weakly NP-complete. This is the first labeling problem that is known to belong to this class. We give a pseudo-polynomial time algorithm for it. In case of a sloping line points can be labeled with maximum-size square labels in O(n log n) time if four label positions per point are allowed and in O(n3 log n) time if labels can slide. We also investigate rectangular labels.