Abstract
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.
Research partially supported by NSERC.
This work was done while the first author was at the University of Waterloo.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
B. Chazelle et al. Application challenges to computational geometry: CG impact task force report. Technical Report TR-521-96, Princeton Univ., April 1996.
J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point feature label placement. ACM Transactions on Graphics. 14(3) (1995), 203–232.
J. Christensen, S. Friedman, J. Marks, and S. Shieber. Empirical testing of algorithms for variable-sized label placement. Proc. 13th ACM Symp. on Comp. Geom. (1997), 415–417.
M. Formann and F. Wagner. A packing problem with applications in lettering of maps. In Proc. 7th ACM Symp. on Comp. Geom. (1991) 281–288.
C. Iturriaga and A. Lubiw. NP-hardness of some map labeling problems. Technical Report CS 97-18. University of Waterloo, 1997.
C. Iturriaga and A. Lubiw. Elastic labels: the two-axis case. In G. Di Battista editor, Graph Drawing (Proc. GD’97). vol. 1353 of LNCS. Springer-Verlag. (1998), 181–192.
C. Iturriaga. Map Labeling Problems, Ph.D. Thesis, University of Waterloo, 1999.
T. Kato and H. Imai. The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. Record of Joint Conference of Electrical and Electronic engineers in Kyushu. (1988) 11–18. In Japanese.
D. Knuth and A. Raghunathan. The problem of compatible representatives. SIAM Disc. Math. 5(3) (1992), 422–427.
L. Kučera, K. Mehlhorn, B. Preis, and E. Schwarzenecker. Exact algorithms for a geometric packing problem. In Proc. 10th Symp. Theoret. Aspects Comput. Sci., 665 of LNCS, 317–322. Springer-Verlag, 1993.
J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report CRCT-05-91. Harvard University, 1991.
F. Wagner and A. Wolff. A practical map labeling algorithm. Computational Geometry: Theory and Applications. (1997) 387–404.
A. Wolff and T. Strijk. A map labeling bibliography, 1996. http://www.inf.fu-berlin.de/map-labeling/papers.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iturriaga, C., Lubiw, A. (1999). Elastic Labels Around the Perimeter of a Map. In: Dehne, F., Sack, JR., Gupta, A., Tamassia, R. (eds) Algorithms and Data Structures. WADS 1999. Lecture Notes in Computer Science, vol 1663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48447-7_31
Download citation
DOI: https://doi.org/10.1007/3-540-48447-7_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66279-2
Online ISBN: 978-3-540-48447-9
eBook Packages: Springer Book Archive