Minimum point-overlap labelling*

In an application of map labelling to air-traffic control, labels should be placed with as few overlaps as possible since labels include important information about airplanes. Motivated by this application, de Berg and Gerrits (Comput. Geom. 2012) proposed a problem of maximizing the number of free labels (i.e. labels not intersecting with any other label) and developed approximation algorithms for their problem under various label-placement models. In this paper, we propose an alternative problem of minimizing a degree of overlap at a point. Specifically, the objective of this problem is to minimize the maximum of over , where is defined as the sum of weights of labels that overlap with a point p. We develop a 4-approximation algorithm by LP-rounding under the 4-position model. We also investigate the case when labels are rectangles with bounded height/length ratios.

[1]  Petra Mutzel,et al.  Optimal labeling of point features in rectangular labeling models , 2003, Math. Program..

[2]  Alexander Wolff,et al.  Optimizing active ranges for consistent dynamic map labeling , 2010, Comput. Geom..

[3]  Alexander Wolff,et al.  Point labeling with sliding labels , 1999, Comput. Geom..

[4]  Kyung-Yong Chwa,et al.  Labeling points with given rectangles , 2004, Inf. Process. Lett..

[5]  Frank Wagner,et al.  A packing problem with applications to lettering of maps , 1991, SCG '91.

[6]  Mark de Berg,et al.  Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap , 2013, ESA.

[7]  Martin Nöllenburg,et al.  Consistent labeling of rotating maps , 2011, J. Comput. Geom..

[8]  Timothy M. Chan,et al.  Approximation Algorithms for Maximum Independent Set of Pseudo-Disks , 2012, Discret. Comput. Geom..

[9]  Kevin Barraclough,et al.  I and i , 2001, BMJ : British Medical Journal.

[10]  Parinya Chalermsook,et al.  Maximum independent set of rectangles , 2009, SODA.

[11]  Steven Zoraster,et al.  The Solution of Large 0-1 Integer Programming Problems Encountered in Automated Cartography , 1990, Oper. Res..

[12]  Alexander Wolff,et al.  Trimming of Graphs, with Application to Point Labeling , 2008, Theory of Computing Systems.

[13]  Mark de Berg,et al.  Approximation algorithms for free-label maximization , 2012, Comput. Geom..

[14]  Kevin Buchin,et al.  Dynamic Point Labeling is Strongly PSPACE-Complete , 2014, Int. J. Comput. Geom. Appl..

[15]  Keiko Imai,et al.  Polynomial Time Algorithms for Label Size Maximization on Rotating Maps , 2013, CCCG.

[16]  Martin Nöllenburg,et al.  Trajectory-Based Dynamic Map Labeling , 2013, ISAAC.

[17]  Pravin M. Vaidya,et al.  Speeding-up linear programming using fast matrix multiplication , 1989, 30th Annual Symposium on Foundations of Computer Science.

[18]  Alexander Wolff,et al.  Labeling Points with Weights , 2003, Algorithmica.

[19]  Alexander Wolff,et al.  Trimming of Graphs, with Application to Point Labeling , 2009, Theory of Computing Systems.

[20]  Martin Nöllenburg,et al.  Sliding labels for dynamic point labeling , 2011, CCCG.

[21]  Subhash Suri,et al.  Label placement by maximum independent set in rectangles , 1998, CCCG.

[22]  Alexander Wolff,et al.  Beyond Maximum Independent Set: An Extended Integer Programming Formulation for Point Labeling , 2017, ISPRS Int. J. Geo Inf..

[23]  Chung-Shou Liao,et al.  Approximation algorithms on consistent dynamic map labeling , 2014, Theor. Comput. Sci..

[24]  Mark de Berg,et al.  Approximation Algorithms for Free-Label Maximization , 2010, SWAT.