Abstract
A major factor affecting the readability of an illustration that contains textual labels is the degree to which the labels obscure graphical features of the illustration as a result of spatial overlaps. Boundary labeling addresses this problem by attaching the labels to the boundary of a rectangle that contains all features. Then, each feature should be connected to its associated label through a polygonal line, called leader, such that no two leaders intersect.
In this paper we study the boundary labeling problem along a new line of research, according to which different pairs of type leaders (i.e. do and pd, od and pd) are combined to produce boundary labelings. Thus, we are able to overcome the problem that there might be no feasible solution when labels are placed on different sides and only one type of leaders is allowed. Our main contribution is a new algorithm for solving the total leader length minimization problem (i.e., the problem of finding a crossing free boundary labeling, such that the total leader length is minimized) assuming labels of uniform size. We also present an NP-completeness result for the case where the labels are of arbitrary size.
The work of M. Bekos and A. Symvonis is funded by the project PENED-2003. PENED-2003 is co - funded by the European Social Fund (75%) and Greek National Resources (25%).
The work of M. Nöllenburg is supported by the German Research Foundation (DFG) under grant WO 758/4-3.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Baker, K.R., Scudder, G.D.: Sequencing with earliness and tardiness penalties: a review. Operations Research 38, 22–36 (1989)
Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Polygons labelling of minimum leader length. In: Kazuo, M., Kozo, S., Jiro, T. (eds.) Proc. Asia Pacific Symposium on Information Visualisation, CRPIT 1960, pp. 15–21 (2006)
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, New York (2005)
Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications 36, 215–236 (2007)
Benkert, M., Haverkort, H., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria one-sided boundary labeling. In: Proc. 15th Int. Symposium on Graph Drawing (GD 2007). LNCS, vol. 4875, pp. 243–254. Springer, Heidelberg (2007)
Benkert, M., Nöllenburg, M.: Improved algorithms for length-minimal one-sided boundary labeling. In: 23rd European Workshop on Computational Geometry (EWCG 2007), pp. 190–193 (2007)
de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Heidelberg (2000)
Garey, M., Tarjan, R., Wilfong, G.: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330–348 (1988)
Gordon, V., Proth, J.-M., Chu, C.: A survey of the state-of-the-art of common due date assignment and scheduling research. European Journal of Operational Research 139(1), 1–25 (2002)
Hall, P.: On representation of subsets. Journal of the London Mathematical Society 10, 26–30 (1935)
Kao, H.-J., Lin, C.-C., Yen, H.-C.: Many-to-one boundary labeling. In: Proc. Asia Pacific Symposium on Information Visualisation (APVIS 2007), pp. 65–72. IEEE, Los Alamitos (2007)
Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83–97 (1955)
Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18, 1201–1225 (1989)
Wolff, A., Strijk, T.: The Map-Labeling Bibliography (1996), http://i11www.ira.uka.de/map-labeling/bibliography
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bekos, M.A., Kaufmann, M., Nöllenburg, M., Symvonis, A. (2008). Boundary Labeling with Octilinear Leaders . In: Gudmundsson, J. (eds) Algorithm Theory – SWAT 2008. SWAT 2008. Lecture Notes in Computer Science, vol 5124. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69903-3_22
Download citation
DOI: https://doi.org/10.1007/978-3-540-69903-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69900-2
Online ISBN: 978-3-540-69903-3
eBook Packages: Computer ScienceComputer Science (R0)