On the Readability of Boundary Labeling

Barth, Lukas and Gemsa, Andreas and Niedermann, Benjamin (2015) On the Readability of Boundary Labeling. In: Graph Drawing and Network Visualization: 23rd International Symposium, GD 2015, September 24-26, 2015, Los Angeles, CA, USA , pp. 515-527 (Official URL: http://dx.doi.org/10.1007/978-3-319-27261-0_42).

Full text not available from this repository.

Abstract

Boundary labeling deals with annotating features in images such that labels are placed outside of the image and are connected by curves (so-called leaders) to the corresponding features. While boundary labeling has been extensively investigated from an algorithmic perspective, the research on its readability has been neglected. In this paper we present the first formal user study on the readability of boundary labeling. We consider the four most studied leader types with respect to their performance, i.e., whether and how fast a viewer can assign a feature to its label and vice versa. We give a detailed analysis of the results regarding the readability of the four models and discuss their aesthetic qualities based on the users’ preference judgments and interviews.

Item Type:Conference Paper
Classifications:D Aesthetics > D.999 Others
G Algorithms and Complexity > G.630 Labeling
ID Code:1516

Repository Staff Only: item control page

References

Ali, K., Hartmann, K., Strothotte, T.: Label layout for interactive 3D illustrations. J. WSCG 13(1), 1–8 (2005)

Barth, L., Gemsa, A., Niedermann, B., Nöllenburg, M.: On the Readability of Boundary Labeling. CoRR, abs/1509.00379 (2015)

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.: Multi-stack boundary labeling problems. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 81–92. Springer, Heidelberg (2006)

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)

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)

Fink, M., Haunert, J.-H., Schulz, A., Spoerhase, J., Wolff, A.: Algorithms for labeling focus regions. IEEE Trans. Vis. Comput. Graph. 18(12), 2583–2592 (2012)

Gemsa, A., Haunert, J.-H., Nöllenburg, M.: Boundary-labeling algorithms for panorama images. In: ACM GIS 2011, New York, USA, pp. 289–298 (2011)

Huang, Z.-D., Poon, S.-H., Lin, C.-C.: Boundary labeling with flexible label positions. In: Pal, S.P., Sadakane, K. (eds.) WALCOM 2014. LNCS, vol. 8344, pp. 44–55. Springer, Heidelberg (2014)

Kindermann, P., Niedermann, B., Rutter, I., Schaefer, M., Schulz, A., Wolff, A.: Two-sided boundary labeling with adjacent sides. In: Dehne, F., Solis-Oba, R., Sack, J.-R. (eds.) WADS 2013. LNCS, vol. 8037, pp. 463–474. Springer, Heidelberg (2013)

Lin, C., Wu, H., Yen, H.: Boundary labeling in text annotation. In: Banissi, E., et al., (ed.) IV 2009, pp. 110–115. IEEE (2009)

Lin, C.-C., Kao, H.-J., Yen, H.-C.: Many-to-one boundary labeling. J. Graph Algorithms Appl. 12(3), 319–356 (2008)

Löffler, M., Nöllenburg, M.: Shooting bricks with orthogonal laser beams: a first step towards internal/external map labeling. CCCG 2010, 203–206 (2010)

Morrison, J.L.: Computer technology and cartographic change. In: Taylor, D. (ed.) The Computer in Contemporary Cartography. Johns Hopkins University Press, Baltimore (1980)

Nöllenburg, M., Polishchuk, V., Sysikaski, M.: Dynamic one-sided boundary labeling. In: ACM-GIS 2010, pp. 310–319 (2010)

Tufte, E.R.: The Visual Display of Quantitative Information. Graphics Press, Cheshire (2001)

Ware, C.: Information Visualization: Perception for Design, 3rd edn. Morgan Kaufmann, San Francisco (2012)

Ware, C., Purchase, H., Colpoys, L., McGill, M.: Cognitive measurements of graph aesthetics. Inf. Vis. 1(2), 103–110 (2002)