The Community for Technology Leaders
RSS Icon
Issue No.12 - Dec. (2012 vol.18)
pp: 2583-2592
M. Fink , Inst. fur Inf., Univ. Wurzburg, Wurzburg, Germany
Jan-Henrik Haunert , Inst. fur Inf., Univ. Wurzburg, Wurzburg, Germany
A. Schulz , Univ. Munster, Münster, Germany
J. Spoerhase , Inst. fur Inf., Univ. Wurzburg, Wurzburg, Germany
A. Wolff , Inst. fur Inf., Univ. Wurzburg, Wurzburg, Germany
In this paper, we investigate the problem of labeling point sites in focus regions of maps or diagrams. This problem occurs, for example, when the user of a mapping service wants to see the names of restaurants or other POIs in a crowded downtown area but keep the overview over a larger area. Our approach is to place the labels at the boundary of the focus region and connect each site with its label by a linear connection, which is called a leader. In this way, we move labels from the focus region to the less valuable context region surrounding it. In order to make the leader layout well readable, we present algorithms that rule out crossings between leaders and optimize other characteristics such as total leader length and distance between labels. This yields a new variant of the boundary labeling problem, which has been studied in the literature. Other than in traditional boundary labeling, where leaders are usually schematized polylines, we focus on leaders that are either straight-line segments or Bezier curves. Further, we present algorithms that, given the sites, find a position of the focus region that optimizes the above characteristics. We also consider a variant of the problem where we have more sites than space for labels. In this situation, we assume that the sites are prioritized by the user. Alternatively, we take a new facility-location perspective which yields a clustering of the sites. We label one representative of each cluster. If the user wishes, we apply our approach to the sites within a cluster, giving details on demand.
pattern clustering, computer graphics, curve fitting, diagrams, site clustering, focus region labeling, point site labeling, diagram, mapping service, leader layout, total leader length, boundary labeling problem, polylines, straight-line segment, Bezier curve, facility-location perspective, Clustering methods, Gravity, Ubiquitous computing, Labels, Visual analytics, Data visualization, Geospatial analysis, geographic/geospatial visualization, Focus+context techniques, data clustering, mobile and ubiquitous visualization
M. Fink, Jan-Henrik Haunert, A. Schulz, J. Spoerhase, A. Wolff, "Algorithms for Labeling Focus Regions", IEEE Transactions on Visualization & Computer Graphics, vol.18, no. 12, pp. 2583-2592, Dec. 2012, doi:10.1109/TVCG.2012.193
[1] D. Yamamoto, S. Ozeki, and N. Takahashi,“Focus+glue+context: an improved fisheye approach for web map services,” in Proc. 17th Annu. ACM Conf Advances Geogr. Inform. Syst. (ACM-GIS‘09). ACM, 2009, pp. 101-110.
[2] J.-H. Haunert and L. Sering,“Drawing road networks with focus regions,” IEEE Trans. Vis. Comput. Graphics, 17, 12, pp. 2555-2562, 2011.
[3] C. Olston and A. Woodruff,“Getting portals to behave,” in Proc. 6th IEEE Symp. Inform. Vis. (Info Vis ‘00), 2000, pp. 15-25.
[4] A. Zipf and K.-F. Richter,“Using focus maps to ease map reading: Developing smart applications for mobile devices,” Kiinstliche Intelligent; vol. 02,no. 4, pp. 35-37, 2002.
[5] M. Steinberger, M. Waldner, M. Streit., A. Lex, and D. Schmalstieg,“Context-preserving visual links,” IEEE Trans. Vis. Comput. Graphics, 17, 12, pp. 2249-2258, 2011.
[6] M. A. Bekos, M. Kaufmann, A. Symvonis,, and A. Wolff,“Boundary labeling: Models and efficient algorithms for rectangular maps,” Comput. Geom. Theory Appl., 36, 3, pp. 215-236, 2007. [Online]. Available:
[7] M. Wertheimer,“Laws of organization in percetional forms,” in A source book of Gestalt psychology. Routledge & Kegan Paul, London, 1938, pp. 71-88.
[8] J.-D. Fekete and C. Plaisant,“Excentric labeling: Dynamic neighborhood labeling for data visualization,” in Proc. ACM Conf Human Factors Comput. Syst. (CHI‘99), 1999, pp. 512-519.
[9] J. L. Morrison,“Computer technology and cartographic change,” in The Computer in Contemporary Cartography D. Taylor Ed. Johns Hopkins University Press, 1980.
[10] J. Christensen, J. Marks, and S. Shieber,“An empirical study of algorithms for point-feature label placement,” ACM Trans. Graphics, 14, 3, pp. 203-232, 1995. [Online]. Available: 0.1145212332.212334
[11] F. Wagner, A. Wolff, V. Kapoor,, and T. Strijk,“Three rules suffice for good label placement,” Algorithmica, 30, 2, pp. 334-349, 2001. [Online]. Available:–001-0009–7
[12] J.-D. Fekete and C. Plaisant,“Excentric labeling: Dynamic neighborhood labeling for data visualization,” Dept. Comput. Sci., Univ. of Maryland, Tech. Rep. HCIL-98–09, 1998. [Online]. Available:–09
[13] M. A. Bekos, M. Kaufmann, M. Nöllenburg,, and A. Symvonis,“Boundary labeling with octilinear leaders,” Algorithmica, 57, 3, pp. 436-461, 2010.
[14] M. A. Bekos, M. Kaufmann, D. Papadopoulos,, and A. Symvonis,“Combining traditional map labeling with boundary labeling,” in Proc. 37th Conf Current Trends Theory Practice Comput. Sci. (SOFSEM‘11) ser. Lect. Notes Comput. Sci. I. Cerná, T. Gyimóthy, J. Hromkovic, K. G. Jeffery, R. Královic, M. Vukolic,, and S. Wolf, Eds., 6543. Springer-Verlag, 2011, pp. 111- 122.
[15] K. Hartmann, T. Götzelmann, K. Ali,, and T. Strothotte,“Metrics for functional and aesthetic label layouts,” in Proc. 5th Internat. Symp. Smart Graphics (SG‘05), ser. Lect. Notes Comput. Sci. A. Butz, B. Fisher., A. Krüger, and P. Olivier, Eds., 3638. Springer-Verlag, 2005, pp. 115-126.
[16] K. Ali, K. Hartmann, and T. Strothotte,“Label layout for interactive 3D illustrations,” J. WSCG, 13, 1, pp. 1-8, 2005.
[17] B. Speckmann and K. Verbeek,“Necklace maps,” IEEE Trans. Vis. Comput. Graphics, 16, 6, pp. 881-889, 2010.
[18] D. Wigdor and R. Balakrishnan,“Empirical investigation into the effect of orientation on text readability in tabletop displays,” in Proc. 9th Eu-rop. Conf Computer-Supported Cooperative Work (ECSCW‘05), 2005, pp. 205-224.
[19] P. K. Agarwal, A. Efrat, and M. Sharir,“Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications,” SIAM J. Comput., 29, 3, pp. 912-953, 1999.
[20] M. Blum,R. W. Floyd, V. Pratt, R. L. Rivest,, and R. E. Tarjan,“Time bounds for selection,” J. Comput. Syst. Sci., 7, 4, pp. 448-461, 1973. [Online]. Available:–0000(73) 80033–9
[21] H. W. Kuhn,“The Hungarian method for the assignment problem,” Naval Research Logistics Quarterly, 2, pp. 83-97, 1955.
[22] D. Arthur and S. Vassilvitskii,“k-means++: The advantages of careful seeding,” in Proc. 18th Ann. ACM-SIAM Symp. Discrete Algorithms (SODA‘07), 2007, pp. 1027-1035.
[23] R. Chithambaram, K. Beard, and R. Barrera,“Skeletonizing polygons for map generalization,” in Technical papers, ACSM-ASPRS Convention, Cartography and GIS/LIS, 2, 1991, pp. 44-54.
[24] M. Bader and R. Weibel,“Detecting and resolving size and proximity conflicts in the generalization of polygonal maps,” in Proc. 18th ICA/ACI Int. Cartogr. Conf. (ICC‘97), Stockholm, 1997, pp. 1525-1532.
[25] P. L. Chew,“Constrained Delaunay triangulations,” Algorithmica, 4, pp. 97-108, 1989. [Online]. Available:
[26] W. Böhm,G. E. Farin,, and J. Kahmann,“A survey of curve and surface methods in CAGD,” Comput. Aided Geom. Design, 1, 1, pp. 1-60, 1984.
[27] T. M. J. Fruchterman and E. M. Reingold,“Graph drawing by force-directed placement,” Softw. Pract. Exper., 21, 11, pp. 1129-1164, 1991.
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool