Abstract
In the air-traffic control, the information related to each air-plane needs to be always displayed as the label. Motivated by this application, de Berg and Gerrits (Comput. Geom. 2012) presented free-label maximization problem, where the goal is to maximize the number of intersection-free labels. In this paper, we introduce an alternative labeling problem for the air-traffic control, called point-overlap minimization. In this problem, we focus on the number of overlapping labels at a point in the plane, and minimize the maximum among such numbers. Instead of maximizing the number of readable labels as in the free-label maximization, we here minimize the cost required for making unreadable labels readable. We provide a 4-approximation algorithm using LP rounding for arbitrary rectangular labels and a faster combinatorial 8-approximation algorithm for unit-square labels.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adamaszek, A., Wiese, A.: Approximation schemes for maximum weight independent set of rectangles. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, Berkeley, CA, USA, 26–29 October 2013, pp. 400–409 (2013)
Agarwal, P.K., van Kreveld, M.J., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3–4), 209–218 (1998)
Been, K., Nöllenburg, M., Poon, S.H., Wolff, A.: Optimizing active ranges for consistent dynamic map labeling. Comput. Geom. 43(3), 312–328 (2010)
de Berg, M., Gerrits, D.H.P.: Approximation algorithms for free-label maximization. Comput. Geom. 45(4), 153–168 (2012)
de Berg, M., Gerrits, D.H.P.: Labeling moving points with a trade-off between label speed and label overlap. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 373–384. Springer, Heidelberg (2013). doi:10.1007/978-3-642-40450-4_32
Buchin, K., Gerrits, D.H.P.: Dynamic point labeling is strongly PSPACE-complete. Int. J. Comput. Geom. Appl. 24(4), 373–395 (2014)
Chalermsook, P., Chuzhoy, J.: Maximum independent set of rectangles. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, 4–6 January 2009, pp. 892–901 (2009)
Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discret. Comput. Geom. 48(2), 373–392 (2012)
Chuzhoy, J., Ene, A.: On approximating maximum independent set of rectangles. In: IEEE 57th Annual Symposium on Foundations of Computer Science, FOCS 2016, Hyatt Regency, New Brunswick, New Jersey, USA, 9–11 October 2016, pp. 820–829 (2016)
Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proceedings of the Seventh Annual Symposium on Computational Geometry, North Conway, NH, USA, 10–12 June 1991, pp. 281–288 (1991)
Gemsa, A., Niedermann, B., Nöllenburg, M.: Trajectory-based dynamic map labeling. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 413–423. Springer, Heidelberg (2013). doi:10.1007/978-3-642-45030-3_39
Gemsa, A., Nöllenburg, M., Rutter, I.: Sliding labels for dynamic point labeling. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, 10–12 August 2011 (2011)
Gemsa, A., Nöllenburg, M., Rutter, I.: Consistent labeling of rotating maps. JoCG 7(1), 308–331 (2016)
Jung, J.W., Chwa, K.Y.: Labeling points with given rectangles. Inf. Process. Lett. 89(3), 115–121 (2004)
van Kreveld, M.J., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. 13(1), 21–47 (1999)
Liao, C., Liang, C., Poon, S.: Approximation algorithms on consistent dynamic map labeling. Theor. Comput. Sci. 640, 84–93 (2016)
Renegar, J.: A polynomial-time algorithm, based on Newton’s method, for linear programming. Math. Program. 40(1–3), 59–93 (1988)
Wolff, A., Strijk, T.: The map-labeling bibliography (2009). http://i11www.iti.uni-karlsruhe.de/map-labeling/bibliography/
Yokosuka, Y., Imai, K.: Polynomial time algorithms for label size maximization on rotating maps. In: Proceedings of the 25th Canadian Conference on Computational Geometry, CCCG 2013, Waterloo, Ontario, Canada, 8–10 August 2013, pp. 187–192 (2013)
Zhang, X., Poon, S., Li, M., Lee, V.C.S.: On maxmin active range problem for weighted consistent dynamic map labeling. In: Proceedings of the Seventh International Conference on Advanced Geographic Information Systems, Applications, and Services, GEOProcessing 2015, Lisbon, Portugal, 22–27 February 2015, pp. 32–37 (2015)
Acknowledgments
The work of the second author was supported in part by Grant-in-Aid for Scientific Research of Japan Society for the Promotion of Science.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Higashikawa, Y., Imai, K., Matsumoto, Y., Sukegawa, N., Yokosuka, Y. (2017). Minimum Point-Overlap Labeling. In: Fotakis, D., Pagourtzis, A., Paschos, V. (eds) Algorithms and Complexity. CIAC 2017. Lecture Notes in Computer Science(), vol 10236. Springer, Cham. https://doi.org/10.1007/978-3-319-57586-5_28
Download citation
DOI: https://doi.org/10.1007/978-3-319-57586-5_28
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-57585-8
Online ISBN: 978-3-319-57586-5
eBook Packages: Computer ScienceComputer Science (R0)