Abstract
Annotating maps, graphs, and diagrams with pieces of text is an important step in information visualization that is usually referred to as label placement. We define nine label-placement models for labeling points with axis-parallel rectangles given a weight for each point. There are two groups; fixed-position models and slider models. We aim to maximize the weight sum of those points that receive a label.
We first compare our models by giving bounds for the ratios between the weights of maximum-weight labelings in different models. Then we present algorithms for labeling n points with unit-height rectangles. We show how an O(n log n)-time factor-2 approximation algorithm and a PTAS for fixed-position models can be extended to handle the weighted case. Our main contribution is the first algorithm for weighted sliding labels. Its approximation factor is (2 + ε), it runs in O n 2 /ε) time and uses O n/ε space. We also investigate some special cases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
P. K. Agarwal, M. van Kreveld, and S. Suri. Label placement by maximum independent set in rectangles. Comp. Geom.: Theory and Appl., 11:209–218, 1998.
P. Berman and B. DasGupta. Multi-phase algorithms for throughput maximization for real-time scheduling. J. Comb. Optimization, 4(3):307–323, Sept. 2000.
B. Chazelle and 36 co-authors. The computational geometry impact task force report. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223, pages 407–463. AMS, 1999.
J. Christensen, J. Marks, and S. Shieber. An empirical study of algorithms for point-feature label placement. ACM Transact. on Graphics, 14(3):203–232, 1995.
T. Erlebach, K. Jansen, and E. Seidel. Polynomial-time approximation schemes for geometric graphs. In Proc. SODA’01, pages 671–679, Washington, 2001.
M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 281–288, 1991.
J. Y. Hsiao, C. Y. Tang, and R. S. Chang. An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. IPL, 43(5):229–235, 1992.
C. Iturriaga. Map Labeling Problems. PhD thesis, University of Waterloo, 1999.
J. L. Morrison. Computer technology and cartographic change. In D. Taylor, ed., The Computer in Contemporary Cartography. J. Hopkins Univ. Press, NY, 1980.
S.-H. Poon, C.-S. Shin, T. Strijk, and A. Wolff.. Labeling points with weights. TR 7/2001, Universität Greifswald, May 2001. Available at http://www.math-inf.uni-greifswald.de/map-labeling/papers/pssw-lpw-01t.ps.gz.
T. Strijk and M. van Kreveld. Practical extensions of point labeling in the slider model. In Proc. 7th ACM Symp. on Advances in GIS, pages 47–52, 1999.
M. van Kreveld, T. Strijk, and A. Wolff.. Point labeling with sliding labels. Computational Geometry: Theory and Applications, 13:21–47, 1999.
A. Wolff. and T. Strijk. The Map-Labeling Bibliography. http://www.math-inf.uni-greifswald.de/map-labeling/bibliography/, 1996.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Poon, SH., Shin, CS., Strijk, T., Wolff, A. (2001). Labeling Points with Weights. In: Eades, P., Takaoka, T. (eds) Algorithms and Computation. ISAAC 2001. Lecture Notes in Computer Science, vol 2223. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45678-3_52
Download citation
DOI: https://doi.org/10.1007/3-540-45678-3_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42985-2
Online ISBN: 978-3-540-45678-0
eBook Packages: Springer Book Archive