Abstract
Driven by the industrial challenge of labeling maps for GIS applications, we investigate the problem of computing the largest convex partitioning of the map P such that the rectangular axis-parallel label L can be placed in it. The map region to be labeled is in general non-convex and may contain holes. Our main result is the new polygonal area removal (PAR) algorithm to identify the area within P where the center of the labelL can be placed. We then derive a new and faster algorithm based on the sweep technique that determines the complete set of maximum inscribed rectangles (MIR) in P in the most common case when rectangle sides have an axis-parallel orientation. The set of all maximum inscribed rectangles is then post-processed to produce the best size/orientation combination of the final label placement depending on the specific requirements from the end users.
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.
References
Agarwal, P.K., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geometry: Theory Appl. 11, 209–218 (1998)
Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 49–59. Springer, Heidelberg (2005)
Berman, P.: Bhaskar Das Gupta, S. Muthukrishnan, and Suneeta Ramaswami. Efficient approximation algorithm for tiling and packing problems with rectangles. Journal of Algorithms 41(2), 443–470 (2001)
Chan, T.M.: A note on maximum independent sets in rectangle intersection graphs. Information Processing Letters 89(1), 19–23 (2004)
Gupta, U.I., Lee, D.T., Leung, J.Y.-T.: Efficient algorithms for interval graphs and circular arc graphs. Networks 12, 459–467 (1982)
Imai, H., Asano, T.: Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane. J. Algorithms 4, 310–323 (1983)
Jiang, M., Bereg, S., Qin, Z., Zhu, B.: New bounds on map labeling with circular labels. In: Fleischer, R., Trippen, G. (eds.) ISAAC 2004. LNCS, vol. 3341, pp. 606–617. Springer, Heidelberg (2004)
Roy, S., Goswami, P.P., Das, S., Nandy, S.C.: Optimal algorithm for a special point-labeling problem. Information Processing Letters 89(2), 91–98 (2004)
van Kreveld, M., Schramm, É., Wolff, A.: Algorithms for the placement of diagrams on maps. In: Pfoder, D., Cruz, I.F., Ronthaler, M. (eds.) Proc. 12th Int. Symp. ACM GIS (GIS 2004), pp. 222–231 (2004)
Zhang, Q., Harrie, L.: Real-time map labelling for personal navigation. In: Proc. 12th Int. Conf. on Geoinformatics, Gävle, Sweden, June 7-9 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gavrilova, M.L. (2006). Two Map Labeling Algorithms for GIS Applications. In: Gavrilova, M., et al. Computational Science and Its Applications - ICCSA 2006. ICCSA 2006. Lecture Notes in Computer Science, vol 3980. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11751540_8
Download citation
DOI: https://doi.org/10.1007/11751540_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34070-6
Online ISBN: 978-3-540-34071-3
eBook Packages: Computer ScienceComputer Science (R0)