Abstract
In the Boundary Labeling problem, we are given a set of n points, referred to as sites, inside an axis-parallel rectangle R, and a set of n pairwise disjoint rectangular labels that are attached to R from the outside. The task is to connect the sites to the labels by non-intersecting rectilinear paths, so-called leaders, with at most one bend.
In this paper, we study the problem Two-Sided Boundary Labeling with Adjacent Sides, where labels lie on two adjacent sides of the enclosing rectangle. We present a polynomial-time algorithm that computes a crossing-free leader layout if one exists. So far, such an algorithm has only been known for the cases that labels lie on one side or on two opposite sides of R (where a crossing-free solution always exists). For the more difficult case where labels lie on adjacent sides, we show how to compute crossing-free leader layouts that maximize the number of labeled points or minimize the total leader length.
This research was initiated during the GraDr Midterm meeting at the TU Berlin, which was supported by an ESF networking grant. Ph. Kindermann acknowledges support by the ESF EuroGIGA project GraDR (DFG grant Wo 758/5-1).
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., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. SIAM J. Comput. 29(3), 912–953 (1999)
Bekos, M.A., Kaufmann, M., Nöllenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. Algorithmica 57(3), 436–461 (2010)
Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Area-feature boundary labeling. Comput. J. 53(6), 827–841 (2010)
Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. Comput. Geom. Theory Appl. 36(3), 215–236 (2007), http://dx.doi.org/10.1016/j.comgeo.2006.05.003
Benkert, M., Haverkort, H.J., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria boundary labeling. J. Graph. Algorithms Appl. 13(3), 289–317 (2009)
Chazelle, B.: 36 co-authors: The computational geometry impact task force report. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, vol. 223, pp. 407–463. American Mathematical Society, Providence (1999)
Fink, M., Haunert, J.H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for labeling focus regions. IEEE Trans. Visual. Comput. Graphics 18(12), 2583–2592 (2012), http://dx.doi.org/10.1109/TVCG.2012.193
Freeman, H., Marrinan, S., Chitalia, H.: Automated labeling of soil survey maps. In: ASPRS-ACSM Annual Convention, Baltimore, vol. 1, pp. 51–59 (1996)
Gemsa, A., Haunert, J.H., Nöllenburg, M.: Boundary-labeling algorithms for panorama images. In: 19th ACM SIGSPATIAL Int. Conf. Adv. Geogr. Inform. Syst., pp. 289–298 (2011)
Gritzmann, P., Mohar, B., Pach, J., Pollack, R.: Embedding a planar triangulation with vertices at specified positions. Amer. Math. Mon. 98, 165–166 (1991)
Hirschberg, D.S.: A linear space algorithm for computing maximal common subsequences. Comm. ACM 18(6), 341–343 (1975)
Katz, B., Krug, M., Rutter, I., Wolff, A.: Manhattan-geodesic embedding of planar graphs. In: Eppstein, D., Gansner, E.R. (eds.) GD 2009. LNCS, vol. 5849, pp. 207–218. Springer, Heidelberg (2010)
Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-sided boundary labeling with adjacent sides. Arxiv report (May 2013), http://arxiv.org/abs/1305.0750
van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom. Theory Appl. 13, 21–47 (1999), http://dx.doi.org/10.1016/S0925-77219900005-X
Morrison, J.L.: Computer technology and cartographic change. In: Taylor, D. (ed.) The Computer in Contemporary Cartography. Johns Hopkins University Press (1980)
Nöllenburg, M., Polishchuk, V., Sysikaski, M.: Dynamic one-sided boundary labeling. In: 18th ACM SIGSPATIAL Int. Symp. Adv. Geogr. Inform. Syst., pp. 310–319 (2010)
Raghavan, R., Cohoon, J., Sahni, S.: Single bend wiring. J. Algorithms 7(2), 232–257 (1986)
Speckmann, B., Verbeek, K.: Homotopic rectilinear routing with few links and thick edges. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 468–479. Springer, Heidelberg (2010)
Zoraster, S.: Practical results using simulated annealing for point feature label placement. Cartography and GIS 24(4), 228–238 (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A. (2013). Two-Sided Boundary Labeling with Adjacent Sides. In: Dehne, F., Solis-Oba, R., Sack, JR. (eds) Algorithms and Data Structures. WADS 2013. Lecture Notes in Computer Science, vol 8037. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40104-6_40
Download citation
DOI: https://doi.org/10.1007/978-3-642-40104-6_40
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40103-9
Online ISBN: 978-3-642-40104-6
eBook Packages: Computer ScienceComputer Science (R0)