A packing problem with applications to lettering of maps
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
The problem of compatible representatives
SIAM Journal on Discrete Mathematics
An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
Approximation schemes for covering and packing problems in image processing and VLSI
Journal of the ACM (JACM)
A practical map labeling algorithm
Computational Geometry: Theory and Applications
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Efficient approximation algorithms for tiling and packing problems with rectangles
Journal of Algorithms
Elastic Labels: the Two-Axis Case
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Polynomial time algorithms for three-label point labeling
Theoretical Computer Science - Computing and combinatorics
A simple factor-3 approximation for labeling points with circles
Information Processing Letters
Elastic labels around the perimeter of a map
Journal of Algorithms
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Maximizing the number of independent labels in the plane
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Maximizing the number of independent labels in the plane
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Periodic multi-labeling of public transit lines
GIScience'10 Proceedings of the 6th international conference on Geographic information science
Hi-index | 0.00 |
In this paper, we consider a map labeling problem to maximize the number of independent labels in the plane. We first investigate the point labeling model that each label can be placed on a given set of anchors on a horizontal line. It is known that most of the map labeling decision models on a single line (horizontal or slope line) can be easily solved. However, the label number maximization models are more difficult (like 2SAT vs. MAX-2SAT). We present an O(n log Δ) time algorithm for the four position label model on a horizontal line based on dynamic programming and a particular analysis, where n is the number of the anchors and Δ is the maximum number of labels whose intersection is nonempty. As a contrast to Agarwal et al.'s result [Comput. Geom. Theory Appl. 11 (1998) 209-218] and Chan's result [Inform. Process. Letters 89(2004) 19-23] in which they provide (1 + 1/k)-factor PTAS algorithms that run in O(n log n + n2k-1) time and O(n log n + nΔk-1) time respectively for the fixed-height rectangle label placement model in the plane, we extend our method to improve their algorithms and present a (1 + 1/k)-factor PTAS algorithm that runs in O(n log n + kn log4 Δ + Δk-1) time using O(kΔ3 log4 Δ + kΔk-1) storage.