A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
A polynomial time solution for labeling a rectilinear map
Information Processing Letters
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Labeling a rectilinear map more efficiently
Information Processing Letters
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Practical Extensions of Point Labeling in the Slider Model*
Geoinformatica
Optimal algorithm for a special point-labeling problem
Information Processing Letters
Computational Geometry: Algorithms and Applications
Computational Geometry: Algorithms and Applications
| Hi-index | 0.89 |
In the point site labeling problem, we are given a set P={p"1,p"2,...,p"n} of point sites in the plane. The label of a point p"i is an axis-parallel rectangle of specified size. The objective is to label the maximum number of points on the map so that the placed labels are mutually non-overlapping. Here, we investigate a special class of the point site labeling problem where (i) height of the labels of all the points are same but their lengths may differ, (ii) the label of a point p"i touches the point at one of its four corners, and (iii) the label of one point does not obscure any other point in P. We describe an efficient heuristic algorithm for this problem which runs in O(nn) time in the worst case. We run our algorithm as well as the algorithm Rules proposed by Wagner et al. on randomly generated point sets and on the available benchmarks. The results produced by our algorithm are almost the same as Rules in most of the cases. But our algorithm is faster than Rules in dense instance. We have also computed the optimum solutions for all the examples we have considered by designing an algorithm, which performs an exhaustive search in the worst case. We found that the exhaustive search algorithm runs reasonably fast for most of the examples we have considered.