Skip to main content
Log in

Boundary Labeling with Octilinear Leaders

Algorithmica Aims and scope Submit manuscript

Abstract

An illustration with textual labels may be hard to read if the labels overlap parts of the illustration. 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 with octilinear leaders, i.e., leaders involving horizontal, vertical, and diagonal segments. In order to produce crossing-free boundary labelings, we combine different pairs of octilinear leaders. Thus, we are able to overcome infeasibility problems that might arise if only a single type of leader 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adel’son-Vel’skii, G., Landis, E.: An algorithm for the organization of information. Sov. Math. Dokl. 3, 1259–1263 (1962)

    Google Scholar 

  2. Battista, G.D., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice-Hall, New York (1999)

    MATH  Google Scholar 

  3. Bayer, R.: Symmetric binary b-trees: data structures and maintenance algorithms. Acta Inf. 1, 290–306 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Multi-stack boundary labeling problems. In: Proc. 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS2006). Lecture Notes in Computer Science, vol. 4337, pp. 81–92. Springer, Berlin (2006)

    Chapter  Google Scholar 

  5. 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 (APVIS2006), CRPIT 60, pp. 15–21 (2006)

  6. Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. In: Pach, J. (ed.) Proc. 12th Int. Symposium on Graph Drawing (GD’04). Lecture Notes in Computer Science, vol. 3383, pp. 49–59. Springer, New York (2005)

    Google Scholar 

  7. Bekos, M.A., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: models and efficient algorithms for rectangular maps. Comput. Geom., Theory Appl. 36, 215–236 (2007)

    MATH  MathSciNet  Google Scholar 

  8. 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’07). Lecture Notes in Computer Science, vol. 4875, pp. 243–254. Springer, Berlin (2007)

    Google Scholar 

  9. de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Berlin (2000)

    MATH  Google Scholar 

  10. Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th Annu. ACM Sympos. Comput. Geom., pp. 281–288 (1991)

  11. Garey, M., Tarjan, R., Wilfong, G.: One-processor scheduling with symmetric earliness and tardiness penalties. Math. Oper. Res. 13, 330–348 (1988)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kao, H.-J., Lin, C.-C., Yen, H.-C.: Many-to-one boundary labeling. In: Proc. Asia Pacific Symposium on Information Visualisation (APVIS2007), pp. 65–72. IEEE, New York (2007)

    Chapter  Google Scholar 

  13. Kaufmann, M., Wagner, D. (eds.): Drawing Graphs: Methods and Models. Lecture Notes in Computer Science, vol. 2025. Springer, Berlin (2001)

    MATH  Google Scholar 

  14. Kuhn, H.W.: The Hungarian method for the assignment problem. Nav. Res. Logist. Q. 2, 83–97 (1955)

    Article  Google Scholar 

  15. Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18, 1201–1225 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  16. van Kreveld, M., Strijk, T., Wolff, A.: Point labeling with sliding labels. Comput. Geom., Theory Appl. 13, 21–47 (1999)

    MATH  Google Scholar 

  17. Wolff, A., Strijk, T.: The map-labeling bibliography, maintained since 1996. Online: http://i11www.iti.uni-karlsruhe.de/~awolff/map-labeling/bibliography/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michael A. Bekos.

Additional information

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.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bekos, M.A., Kaufmann, M., Nöllenburg, M. et al. Boundary Labeling with Octilinear Leaders. Algorithmica 57, 436–461 (2010). https://doi.org/10.1007/s00453-009-9283-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-009-9283-6

Keywords

Navigation