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
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)
Map labeling heuristics: provably good and practically useful
Proceedings of the eleventh 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
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
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 Factor-2 Approximation for Labeling Points with Maximum Sliding Labels
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
Label updating to avoid point-shaped obstacles in fixed model
Theoretical Computer Science
Matching points with rectangles and squares
Computational Geometry: Theory and Applications
Algorithms for the multiple label placement problem
Computational Geometry: Theory and Applications
Maximizing the number of independent labels in the plane
FAW'07 Proceedings of the 1st annual international conference on Frontiers in algorithmics
Incremental labeling in closed-2PM model
Computers and Electrical Engineering
| Hi-index | 0.00 |
In this paper, we present an O(n2 log n) time solution for the following multi-label map labeling problem: given a set S of n distinct sites in the plane, place at each site a triple of uniform squares of maximum possible size such that all the squares are axis-parallel and a site is on the boundaries of its three labeling squares. We also study the problem under the discrete model, i.e., a site must be at the corners of its three label squares. We obtain an optimal Θ(n log n) time algorithm for the latter problem.