Boundary Labeling with Flexible Label Positions

  • Zhi-Dong Huang
  • Sheung-Hung Poon
  • Chun-Cheng Lin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8344)


Boundary labeling connects each point site in a rectangular map to a label on the sides of the map by a leader, which may be a straight-line segment or a polyline. In the conventional setting, the labels along a side of the map form a single stack of labels in which labels are placed consecutively one by one in a sequence, and the two end sides of a label stack must respect the sides of the map. However, such a setting may be in conflict with generation of a better boundary labeling, measured by the total leader length or the number of bends of leaders. As a result, this paper relaxes this setting to propose the boundary labeling with flexible label positions, in which labels are allowed to be placed at any non-overlapping location along the sides of the map so that they do not necessarily form only one single stack, and the two end sides of label stacks do not need to respect the sides of the map. In this scenario, we investigate the total leader length minimization problem and the total bend minimization problem under several variants, which are parameterized by the number of sides to which labels are attached, their label size, port types, and leader types. It turns out that almost all of the total leader length minimization problems using nonuniform-size labels are NP-complete except for one case, while the others can be solved in polynomial time.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bekos, M.A., Cornelsen, S., Fink, M., Hong, S.-H., Kaufmann, M., Nöllenburg, M., Rutter, I., Symvonis, A.: Many-to-one boundary labeling with backbones. In: Wismath, S., Wolff, A. (eds.) GD 2013. LNCS, vol. 8242, pp. 244–255. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  2. 2.
    Bekos, M., Kaufmann, M., Nöllenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. Algorithmica 57(3), 436–461 (2010)CrossRefzbMATHMathSciNetGoogle Scholar
  3. 3.
    Bekos, M., Kaufmann, M., Potina, K., Symvonis, A.: Area-feature boundary labeling. The Computer Journal 53(6), 827–841 (2009)CrossRefGoogle Scholar
  4. 4.
    Bekos, M., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications 36(3), 215–236 (2006)CrossRefMathSciNetGoogle Scholar
  5. 5.
    Benkert, M., Haverkort, H.J., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria boundary labeling. Journal of Graph Algorithms and Applications 13(3), 289–317 (2009)CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Garey, M., Tarjan, R., Wilfong, G.: One-processor scheduling with symmetric earliness and tardiness penalties. Mathematics of Operations Research 13, 330–348 (1988)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Garey, M.R., Johnson, D.S.: Computers and Interactability. A Guide to the Theory of NP-Completeness. A Series of Books in the Mathematical Sciences, Freemann and Company (1979)Google Scholar
  8. 8.
    Lin, C.C.: Crossing-free many-to-one boundary labeling with hyperleaders. In: Proc. of 3rd IEEE Pacific Visualization Symposium (PacificVis 2010), pp. 185–192. IEEE Press (2010)Google Scholar
  9. 9.
    Lin, C.C., Kao, H.J., Yen, H.C.: Many-to-one boundary labeling. Journal of Graph Algorithms and Applications 12(3), 319–356 (2008)CrossRefzbMATHMathSciNetGoogle Scholar
  10. 10.
    Lin, C.-C., Poon, S.-H., Takahashi, S., Wu, H.-Y., Yen, H.-C.: One-and-a-half-side boundary labeling. In: Wang, W., Zhu, X., Du, D.-Z. (eds.) COCOA 2011. LNCS, vol. 6831, pp. 387–398. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Nöllenburg, M., Polishchuk, V., Sysikaski, M.: Dynamic one-sided boundary labeling. In: GIS, pp. 310–319 (2010)Google Scholar
  12. 12.
    Wagner, F.: Approximate map labeling is in ω(n logn). Information Processing Letters 52(3), 161–165 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Wagner, F., Wolff, A.: Map labeling heuristics: Provably good and practically useful. In: Proc. of the 11th Annual ACM Symposium on Computational Geometry (SoCG 1995), pp. 109–118. ACM Press (1995)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Zhi-Dong Huang
    • 1
  • Sheung-Hung Poon
    • 1
  • Chun-Cheng Lin
    • 2
  1. 1.Dept. of Computer ScienceNational Tsing Hua UniversityHsinchuTaiwan
  2. 2.Dept. of Industrial Engineering and ManagementNational Chiao Tung UniversityHsinchuTaiwan

Personalised recommendations