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)
Empirical testing of algorithms for variable-sized label placement
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
A practical map labeling algorithm
Computational Geometry: Theory and Applications
Exact Algorithms for a Geometric Packing Problem (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Elastic Labels: the Two-Axis Case
GD '97 Proceedings of the 5th International Symposium on Graph Drawing
Boundary labeling: Models and efficient algorithms for rectangular maps
Computational Geometry: Theory and Applications
Graph Drawing
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
Boundary labeling: models and efficient algorithms for rectangular maps
GD'04 Proceedings of the 12th international conference on Graph Drawing
Hi-index | 0.00 |
In this paper we study the map labeling problem of attaching rectangular labels to points, but with the novelty that our labels are elastic, in the sense that the height and width of each rectangle may vary though we require a fixed area. Our main result is a polynomial time algorithm for the rectangle perimeter labeling problem, where the points to be labeled lie on the boundary of a rectangular map. This problem is likely to be relevant in Geographical Information Systems (GIS) as maps are displayed dynamically on a computer screen using clipping, panning, and zooming.