In the air-traffic control, the information related to each air-plane needs to be always displayed as the label. Motivated by this appli-cation, 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 label-ing 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 maximiza-tion, 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.
CITATION STYLE
Higashikawa, Y., Imai, K., Matsumoto, Y., Sukegawa, N., & Yokosuka, Y. (2017). Minimum point-overlap labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10236 LNCS, pp. 334–344). Springer Verlag. https://doi.org/10.1007/978-3-319-57586-5_28
Mendeley helps you to discover research relevant for your work.