Algorithms for Multi-criteria One-Sided Boundary Labeling
We present new algorithms for labeling a set P of n points in the plane with labels that are aligned to the left of the bounding box of P. The points are connected to their labels by curves (leaders) that consist of two segments: a horizontal segment, and a second segment at a fixed angle with the first. Our algorithm finds a collection of non-intersecting leaders that minimizes the total number of bends, the total length, or any other ‘badness’ function of the leaders. An experimental evaluation of the performance is included.
- 1.Ali, K., Hartmann, K., Strothotte, T.: Label layout for interactive 3D illustrations. J. of WSCG 13, 1–8 (2005)Google Scholar
- 3.Bekos, M.A., Kaufmann, M., Potika, K., Symvonis, A.: Polygon labelling of minimum leader length. In: Misue, K., Sugiyama, K., Tanaka, J. (eds.) APVIS 2006. Proc. Asia Pacific Symp. on Inform. Visualisation, CRPIT, vol. 60, pp. 15–21 (2006)Google Scholar
- 5.Fekete, J.-D., Plaisant, C.: Excentric labeling: Dynamic neighborhood labeling for data visualization. In: CHI 1999. Proc. of the SIGCHI conference on Human factors in computing systems, pp. 512–519 (1999)Google Scholar
- 6.Wolff, A., Strijk, T.: The map-labeling bibliography (2006), http://i11www.iti.uni-karlsruhe.de/~awolff/map-labeling/bibliography/