Abstract
Inspired by air traffic control and other applications where moving objects have to be labeled, we consider the following (static) point labeling problem: given a set P of n points in the plane and labels that are unit squares, place a label with each point in P in such a way that the number of free labels (labels not intersecting any other label) is maximized. We develop efficient constant-factor approximation algorithms for this problem, as well as PTASs, for various label-placement models.
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
Been, K., Nöllenburg, M., Poon, S.-H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. Theory Appl. 43(3), 312–328 (2010)
Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Mathieu, C. (ed.) Proc. 20th ACM-SIAM Sympos. on Discrete Algorithms (SODA’09), New York, pp. 892–901 (2009)
Chan, T.: A note on maximum independent set in rectangle intersection graphs. Information Processing Letters 89, 19–23 (2004)
Dorbes, A.: Requirements for the implementation of automatic and manual label anti-overlap functions. EEC Note No. 21/00, EUROCONTROL Experimental Centre (2000)
Edelsbrunner, H., O’Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing 15(2), 341–363 (1986)
Erlebach, T., Hagerup, T., Jansen, K., Minzlaff, M., Wolff, A.: Trimming of graphs, with an application to point labeling. In: Albers, S., Weil, P. (eds.) Proc. 25th Internat. Sympos. Theoretical Aspects Comput. Sci (STACS’08), Bordeaux, pp. 265–276 (2008)
Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annu. ACM Sympos. Comput. Geom (SoCG’91), North Conway, pp. 281–288 (1991)
Fowler, R., Paterson, M., Tanimoto, S.: Optimal packing and covering in the plane are NP-complete. Information Processing Letters 12, 133–137 (1981)
Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM 32(1), 130–136 (1985)
Jiang, M., Bereg, S., Qin, Z., Zhu, B.: New bounds on map labeling with circular labels. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 606–617. Springer, Heidelberg (2004)
van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. Theory Appl. 13, 21–47 (1999)
Marks, J., Shieber, S.: The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard CS (1991)
Poon, S.-H., Shin, C.-S., Strijk, T., Uno, T., Wolff, A.: Labeling points with weights. Algorithmica 38(2), 341–362 (2003)
Rostamabadi, F., Ghodsi, M.: A fast algorithm for updating a labeling to avoid a moving point. In: Proc. 16th Canadian Conf. Comput. Geom. (CCCG’04), pp. 204–208 (2004)
Wolff, A., Strijk, T.: The Map Labeling Bibliography (2009), http://liinwww.ira.uka.de/bibliography/Theory/map.labeling.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Berg, M., Gerrits, D.H.P. (2010). Approximation Algorithms for Free-Label Maximization. In: Kaplan, H. (eds) Algorithm Theory - SWAT 2010. SWAT 2010. Lecture Notes in Computer Science, vol 6139. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13731-0_28
Download citation
DOI: https://doi.org/10.1007/978-3-642-13731-0_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13730-3
Online ISBN: 978-3-642-13731-0
eBook Packages: Computer ScienceComputer Science (R0)