A Fast Algorithm for Point Labeling Problem

In the map labeling problem, we are given a set P = {p1, p2, . . . , pn} of point sites distributed on a 2D map. The label of a point pi is an axis-parallel rectangle of specified size. The objective is to label maximum number of points on the map so that the placed labels are mutually non-overlapping. Here, we investigate a special class of map labeling problem where (i) the height of the label of each point is the same but its length may be different from the others, (ii) the label of a point pi touches the point at one of its four corners and (iii) it does not obscure any other point in P . We describe an efficient heuristic algorithm for this problem which runs in O(n √ n) time in the worst case. We run our algorithm as well as the algorithm proposed in [14] on the available benchmarks [13]. The results produced by our algorithm is same as that of [14] in most of the cases, and is one less in few cases. But the time taken by our algorithm is much less than [14].

[1]  A. R. Forrest,et al.  Application Challenges to Computational Geometry: CG Impact Task Force Report , 1999 .

[2]  Alexander Wolff,et al.  Three Rules Suffice for Good Label Placement , 2001, Algorithmica.

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

[4]  Binhai Zhu,et al.  A polynomial time solution for labeling a rectilinear map , 1997, SCG '97.

[5]  Marc J. van Kreveld,et al.  Practical extensions of point labeling in the slider model , 1999, GIS '99.

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

[7]  Marc J. van Kreveld,et al.  Labeling a Rectilinear Map More Efficiently , 1999, Inf. Process. Lett..

[8]  Joe Marks,et al.  A General Cartographic Labeling Algorithm , 1996 .

[9]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.

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

[11]  Sandip Das,et al.  Optimal Algorithm for a Special Point-Labeling Problem , 2002, SWAT.

[12]  Marc J. van Kreveld,et al.  Practical Extensions of Point Labeling in the Slider Model* , 2002, GeoInformatica.

[13]  E. Imhof.  Positioning Names on Maps , 1975 .

[14]  Sumio Masuda,et al.  Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph , 1992, J. Algorithms.

[15]  Richard M. Karp,et al.  A n^5/2 Algorithm for Maximum Matchings in Bipartite Graphs , 1971, SWAT.