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)
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
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
ACSC '03 Proceedings of the 26th Australasian computer science conference - Volume 16
A smart algorithm for column chart labeling
SG'05 Proceedings of the 5th international conference on Smart Graphics
Hi-index | 0.00 |
This paper presents an efficient algorithm for a new variation of the point feature labeling problem. The goal is to position the largest number of point labels such that they do not intersect each other or their points. First we present an algorithm using a greedy algorithm with limited lookahead. We then present an algorithm that iteratively regroups labels, calling the first algorithm on each group, thereby identifying a close to optimal labeling order. The presented algorithm is being used in a commercial product to label charts, and our evaluation shows that it produces results far superior to those of other labeling algorithms.