An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Lagrangean relaxation with clusters for point-feature cartographic label placement problems
Computers and Operations Research
A greedy randomized adaptive search procedure for the point-feature cartographic label placement
Computers & Geosciences
Computers and Operations Research
Hi-index | 12.05 |
The point-feature cartographic label placement problem (PFCLP) is a NP-Hard problem arising in design of maps and other graphic objects. For the sake of a better map legibility it is important to avoid overlaps in the process of labeling. This paper examines the PFCLP in the legibility context and proposes a dispersion approach for the problem. It is considered that when all points must to be labeled and overlaps are inevitable, the map can be more readable if overlapping labels are placed more distant from each other. The PFCLP is modeled as a dispersion problem on two mathematical formulations based on binary integer linear programming. Computational tests have provided good results on several generated instances.