A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A rule-based system for dense-map name placement
Communications of the ACM
Placing text labels on maps and diagrams
Graphics gems IV
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
Genetic algorithms + data structures = evolution programs (2nd, extended ed.)
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
Evolutionary computation
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
On the convex layers of a planar set
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the quality. This problem is a critical problem in the applications of cartography and Geographical Information Systems (GIS). In this paper we study the fundamental issues related to map labeling of point-feature and develop a new genetic algorithm to solve this problem. We adopt a data structure called convex onion peeling and utilize it in our proposed Convex Onion Peeling Genetic Algorithm (COPGA) to efficiently manage point features. We evaluated the performance of the proposed algorithm through extensive experiments on both synthetic and real datasets. The experimental results show that our genetic algorithm based on the convex onion peeling structure is an efficient, robust and extensible algorithm for automated map labeling of point-feature.