Abstract
We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ranges is maximized. We propose approximation algorithms for several variants of this problem. For the simple ARO problem, we provide a 3c logn-approximation algorithm for the unit-width rectangular labels if there is a c-approximation algorithm for unit-width label placement problem in the plane; and a randomized polynomial-time O(logn loglogn)-approximation algorithm for arbitrary rectangular labels. For the general ARO problem, we prove that it is NP-complete even for congruent square labels with equal selectable scale range. Moreover, we contribute 12-approximation algorithms for both arbitrary square labels and unit-width rectangular labels, and a 6-approximation algorithm for congruent square labels.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangIes. Computational Geometry: Theory and Application 11, 209–218 (1998)
Been, K., Daiches, E., Yap, C.: Dynamic map labeling. IEEE Transactions on Visualization and Computer Graphics 12(5), 773–780 (2006)
Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Computational Geometry: Theory and Application 43(3), 312–328 (2010)
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Berlin (2008)
Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Efficient approximation algorithms for tiling and packing problems with rectangles. Journal of Algorithms 41, 443–470 (2001)
Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proc. 20th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2009), pp. 892–901 (2009)
Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms 46, 178–189 (2003)
Chan, T.M.: A note on maximum independent sets in rectangle intersection graphs. Information Processing Letters 89(1), 19–23 (2004)
Chazelle, B., et al.: The computational geometry impact task force report. In: Advances in Discrete and Computational Geometry, vol. 223, pp.407–463. American Mathematical Society, Providence (1999)
Doddi, S., Marathe, M.V., Mirzaian, A., Moret, B.M.E., Zhu, B.: Map labeling and generalizations. In: Proc.8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), pp. 148–157 (1997)
Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annual Symposium on Computational Geometry (SoCG 1991), pp. 281–288 (1991)
Gemsa, A., Nöllenburg, M., Rutter, I.: Sliding labels for dynamic point labeling. In: Proc. 23th Canadian Conference on Computational Geometry (CCCG 2011), pp. 205–210 (2011)
Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM (JACM) 32(1), 130–136 (1985)
Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discrete Math. 5(3), 422–427 (1992)
Poon, S.-H., Shin, C.-S.: Adaptive zooming in point set labeling. In: Liśkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol. 3623, pp. 233–244. Springer, Heidelberg (2005)
Wolff, A., Strijk, T.: The map-labeling bibliography (2009), http://i11www.iti.uni-karlsruhe.de/map-labeling/bibliography/
Yap, C.K.: Open problem in dynamic map labeling. In: Proc. International Workshop on Combinatoral Algorithms, IWOCA 2009 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Liao, CS., Liang, CW., Poon, SH. (2014). Approximation Algorithms on Consistent Dynamic Map Labeling. In: Chen, J., Hopcroft, J.E., Wang, J. (eds) Frontiers in Algorithmics. FAW 2014. Lecture Notes in Computer Science, vol 8497. Springer, Cham. https://doi.org/10.1007/978-3-319-08016-1_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-08016-1_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08015-4
Online ISBN: 978-3-319-08016-1
eBook Packages: Computer ScienceComputer Science (R0)