Abstract
We consider the NP-hard label number maximization problem lnm: Given a set of rectangular labels, each of which belongs to a point feature in the plane, the task is to find a labeling for a largest subset of the labels. A labeling is a placement such that none of the labels overlap and each is placed so that its boundary touches the corresponding point feature. The purpose of this paper is twofold: We present a new force-based simulated annealing algorithm to heuristically solve the problem and we provide the results of a very thorough experimental comparison of the best known labeling methods on widely used benchmark sets. The design of our new method has been guided by the goal to produce labelings that are similar to the results of an experienced human performing the same task. So we are not only looking for a labeling where the number of labels placed is high but also where the distribution of the placed labels is good.
Our experimental results show that the new algorithm outperforms the other methods in terms of quality while still being reasonably fast and confirm that the simulated annealing method is well-suited for map labeling problems.
Chapter PDF
Similar content being viewed by others
References
Christensen, J., Marks, J., Shieber, S.: An empirical study of algorithms for point-feature label placement. ACM Trans. Graph. 14(3), 203–232 (1995)
Davidson, R., Harel, D.: Drawing graphs nicely using simulated annealing. ACM Transactions on Graphics 15(4), 301–331 (1996)
Eades, P.: A heuristic for graph drawing. Congressus Numerantium 42, 149–160 (1984)
Herodotus: The History of Herodotus. 440 B.C
Hirsch, S.A.: An algorithm for automatic name placement around point data. The American Cartographer 9, 5–17 (1982)
Imhof, E.: Die Anordnung der Namen in der Karte. International Yearbook of Cartography 2, 93–129 (1962)
Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671–680 (1983)
Klau, G.W., Lesh, N., Marks, J., Mitzenmacher, M., Schafer, G.T.: The HuGS platform: A toolkit for interactive optimization. In: Proc. of AVI 2002 International Working Conference on Advanced Visual Interfaces (2002)
Klau, G.W., Mutzel, P.: Optimal labelling of point features in rectangular labelling models. Mathematical Programming 94(2-3), 435–458 (2003)
Kruskal, J., Seery, J.: Designing network diagrams. In: First General Conf. on Social Graphics, pp. 22–50 (1980)
Marks, J., Shieber, S.: The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard University, Cambridge, MA, U.S.A (1991)
Strijk, T., van Kreveld, M.: Practical extensions of point labeling in the slider model. In: Proc. 7th ACM Symp. Adv. Geogr. Inform. Syst., pp. 47–52 (1999)
van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Computational Geometry: Theory and Applications 13, 21–47 (1999)
Yoeli, P.: The logic of automated map lettering. The Cartographic Journal 9, 99–108 (1972)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ebner, D., Klau, G.W., Weiskircher, R. (2005). Label Number Maximization in the Slider Model. In: Pach, J. (eds) Graph Drawing. GD 2004. Lecture Notes in Computer Science, vol 3383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31843-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-540-31843-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24528-5
Online ISBN: 978-3-540-31843-9
eBook Packages: Computer ScienceComputer Science (R0)