Computational geometry: an introduction
Computational geometry: an introduction
Introduction to algorithms
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
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)
Static and dynamic algorithms for k-point clustering problems
Journal of Algorithms
Map labeling heuristics: provably good and practically useful
Proceedings of the eleventh 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
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
Label placement by maximum independent set in rectangles
WADS '97 Selected papers presented at the international workshop on Algorithms and data structure
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Point labeling with sliding labels
Computational Geometry: Theory and Applications - Special issue on applications and challenges
Point set labeling with specified positions
Proceedings of the sixteenth annual symposium on Computational geometry
Cartographic Name Placement with Prolog
IEEE Computer Graphics and Applications
An Algorithm for Labeling Edges of Hierarchical Drawings
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Elastic Labels: the Two-Axis Case
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
New Algorithms for Two-Label Point Labeling
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Polynomial time algorithms for three-label point labeling
Theoretical Computer Science - Computing and combinatorics
Journal of Computer and System Sciences
Labeling points with given rectangles
Information Processing Letters
| Hi-index | 0.00 |
In this paper we present a simple approximation algorithm for the following NP-hard map labeling problem: Given a set S of n distinct sites in the plane, one needs to place at each site an axis-parallel sliding square of maximum possible size (i.e., a site can be anywhere on the boundary of its labeling square) such that no two squares overlap and all the squares have the same size.By exploiting the geometric properties of the problem, we reduce a potential 4SAT problem to a 2SAT problem. We obtain a factor-2 approximation which runs in O(n2 log n) time using discrete labels. This greatly improves the previous factor of 4.