Introduction to algorithms
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)
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
A practical map labeling algorithm
Computational Geometry: Theory and Applications
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Label updating to avoid point-shaped obstacles in fixed model
Theoretical Computer Science
Journal of Visual Languages and Computing
A new fast heuristic for labeling points
Information Processing Letters
Labeling dense maps for location-based services
W2GIS'04 Proceedings of the 4th international conference on Web and Wireless Geographical Information Systems
Hi-index | 0.00 |
This paper extends research by the authors together with Alexander Wolff on point label placement using a model where labels can be placed at any position that touches the point (the slider model). Such models have been shown to perform better than methods that allow only a fixed number of positions per label. The novelties in this paper include respecting other map features that must be avoided by the labels, and incorporating labels with different height. The result is an efficient and simple O((n+m)log(n+m)) time algorithm with a performance guarantee for label placement in the slider model. Here n is the number of points to be labeled and m is the combinatorial complexity of the map features that must be avoided. Due to its efficiency, the algorithm can be used in interactive and on-line mapping.