Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
Maximizing the number of independent labels in the plane
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Periodic multi-labeling of public transit lines
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Boundary-labeling algorithms for panorama images
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
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 NPcomplete. 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(n 3 log n) time if labels can slide. We also investigate rectangular labels.