Data structures and algorithms 3: multi-dimensional searching and computational geometry
Data structures and algorithms 3: multi-dimensional searching and computational geometry
A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
A polynomial time solution for labeling a rectilinear map
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Polygon labelling of minimum leader length
APVis '06 Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
Boundary Labeling in Text Annotation
IV '09 Proceedings of the 2009 13th International Conference Information Visualisation
Boundary Labeling with Octilinear Leaders
Algorithmica - Special Issue: Scandinavian Workshop on Algorithm Theory; Guest Editor: Joachim Gudmundsson
Algorithms for multi-criteria one-sided boundary labeling
GD'07 Proceedings of the 15th international conference on Graph drawing
Multi-stack boundary labeling problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
A zone-based approach for placing annotation labels on metro maps
SG'11 Proceedings of the 11th international conference on Smart graphics
Travel-Route-Centered Metro Map Layout and Annotation
Computer Graphics Forum
Spatially efficient design of annotated metro maps
EuroVis '13 Proceedings of the 15th Eurographics Conference on Visualization
| Hi-index | 0.01 |
The traditional map labeling problems are mostly NP-hard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly internal labels should be preferred, we consider several maximization problems for the number of internal labels and we show that they can be obtained efficiently or in quasi-polynomial time.