Computational geometry: an introduction
Computational geometry: an introduction
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
Approximate map labeling is in &OHgr;(n log n)
Information Processing Letters
An empirical study of algorithms for point-feature label placement
ACM Transactions on Graphics (TOG)
Point set labeling with sliding labels
Proceedings of the fourteenth annual symposium on Computational geometry
A unified approach to labeling graphical features
Proceedings of the fourteenth annual symposium on Computational geometry
A polynomial time solution for labeling a rectilinear map
Information Processing Letters
Map labeling and its generalizations
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Cartographic Name Placement with Prolog
IEEE Computer Graphics and Applications
Static and Dynamic Algorithms for k-Point Clustering Problems
WADS '93 Proceedings of the Third Workshop on Algorithms and Data Structures
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
A Unified Approach to Approximation Schemes for NP- and PSPACE-Hard Problems for Geometric Graphs
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
A Better Lower Bound for Two-Circle Point Labeling
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Polynomial Time Algorithms for Three-Label Point Labeling
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
New Algorithms for Two-Label Point Labeling
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
New bounds on map labeling with circular labels
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Improving multi-label classifiers via label reduction with association rules
HAIS'12 Proceedings of the 7th international conference on Hybrid Artificial Intelligent Systems - Volume Part II
| Hi-index | 0.02 |
In this paper we study two practical variations of the map labeling problem: Given a set S of n distinct sites in the plane, one needs to place at each site: (1) a pair of uniform and non-intersecting squares of maximum possible size, (2) a pair of uniform and nonintersecting circles of maximum possible size. Almost nothing has been done before in this aspect, i.e., multi-label map labeling. We obtain constant-factor approximation algorithms for these problems. We also study bicriteria approximation schemes based on polynomial time approximation schemes (PTAS) for these problems.