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 practical map labeling algorithm
Computational Geometry: Theory and Applications
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
Using Genetic Algorithms for Solving Hard Problems in GIS
Geoinformatica
| Hi-index | 0.00 |
Spatial information is often presented as maps in location-based services, which makes it necessary to label cartographic features in real time. Features may be dense all over the map, or in certain areas. Owing to the limited free spaces, it is always difficult to label dense features. Aiming to utilize free spaces efficiently, this paper proposed a density-based method of labelling dense features. The method placed labels of dense features earlier than sparse ones, so that free spaces were allotted to dense features before consumed by sparse features. An efficient algorithm was developed for map labelling in real time. We implemented this method in a Java environment. A case study shows sound cartographic results and acceptable efficiency of the labelling.