Skip to main content
SpringerLink
Log in
Book cover

Efficient Algorithms pp 290–304Cite as

On Map Labeling with Leaders

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5760))

Abstract

We present an overview over recent work on map labeling with emphasis on labeling with leaders. The labels are assumed to be placed on the boundary of the map while they are connected to the corresponding graphical features by polygonal lines, the so-called leaders. On various models and methods we demonstrate an impressive example for an application where a whole range of algorithmic techniques have successfully been applied.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agarwal, P.K., Efrat, A., Sharir, M.: Vertical decomposition of shallow levels in 3-dimensional arrangements and its applications. In: Proc. 11th Annu. ACM Sympos. Comput. Geom., pp. 39–50 (1995)

    Google Scholar 

  2. Agarwal, P., van Kreveld, M., Suri, S.: Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications 11, 209–218 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  3. Bekos, M., Kaufmann, M., Symvonis, A., Wolff, A.: Boundary labeling: Models and efficient algorithms for rectangular maps. In: Pach, J. (ed.) GD 2004. LNCS, vol. 3383, pp. 49–59. Springer, Heidelberg (2005); An extended version appeared in Computational Geometry: Theory and Applications 36(3), 215–236 (2006)

    Chapter  Google Scholar 

  4. 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)

    Chapter  Google Scholar 

  5. Bekos, M., Kaufmann, M., Potika, K., Symvonis, A.: Polygons Labelling of Minimum Leader Length. In: Proc. Asia Pacific Symposium on Information Visualisation (APVIS 2006). CRPIT 60, pp. 15–21 (2006)

    Google Scholar 

  6. Bekos, M., Kaufmann, M., Potika, K., Symvonis, A.: Area-Feature Boundary Labeling. The Computer Journal (to appear)

    Google Scholar 

  7. Bekos, M., Kaufmann, M., Nöllenburg, M., Symvonis, A.: Boundary labeling with octilinear leaders. In: Gudmundsson, J. (ed.) SWAT 2008. LNCS, vol. 5124, pp. 234–245. Springer, Heidelberg (2008); An extended version is to appear in Algorithmica

    Chapter  Google Scholar 

  8. Benkert, M., Haverkort, H., Kroll, M., Nöllenburg, M.: Algorithms for multi-criteria one-sided boundary labeling. In: Hong, S.-H., Nishizeki, T., Quan, W. (eds.) GD 2007. LNCS, vol. 4875, pp. 243–254. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  9. Chazelle, B., 36 co-authors.: The computational geometry impact task force report. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Computational Geometry, vol. 223, pp. 407–463. AMS (1999)

    Google Scholar 

  10. Christensen, J., Marks, J., Shieber, S.: Algorithms for cartographic label placement. In: Proceedings of the American Congress on Surveying and Mapping, vol. 1, pp. 75–89 (1993)

    Google Scholar 

  11. Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: Proc. 7th ACM Symp. Comp. Geom (SoCG 1991), pp. 281–288 (1991)

    Google Scholar 

  12. Hershberger, J., Suri, S.: Applications of a semi-dynamic convex hull algorithm. BIT 32, 249–267 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. Imhof, E.: Positioning Names on Maps. The American Cartographer 2, 128–144 (1975)

    Article  Google Scholar 

  14. Iturriaga, C., Lubiw, A.: NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo (1997)

    Google Scholar 

  15. Lin, C.-C., Kao, H.-J., Lin, C.-C.: Many-to-one boundary labeling. Journal of Graph Algorithms and Applications (JGAA) 12(3), 319–356 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  16. Kuhn, H.W.: The Hungarian method for the assignment problem. Naval Research Logistic Quarterly 2, 83–97 (1955)

    Article  MathSciNet  MATH  Google Scholar 

  17. Mehlhorn, K.: Data Structures and Algorithms 3: Multi-dimensional Searching and Computational Geometry. EATCS Monographs on Theoretical Computer Science, vol. 3. Springer, Heidelberg (1984)

    Book  MATH  Google Scholar 

  18. Neyer, G.: Map Labeling with Application to Graph Drawing. In: Kaufmann, M., Wagner, D. (eds.) Drawing Graphs. LNCS, vol. 2025, pp. 247–273. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  19. Schmidt, V.A.: Reine Forschung, praktische Resultate. Newspaper article in Die Zeit (April 28, 1995)

    Google Scholar 

  20. Strijk, T., van Kreveld, M.: Labeling a rectilinear map more efficiently. Information Processing Letters 69(1), 25–30 (1999)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  22. Vaidya, P.M.: Geometry helps in matching. SIAM J. Comput. 18, 1201–1225 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  23. Verweij, B., Aardal, K.: An optimisation algorithm for maximum independent set with applications in map labelling. In: Nešetřil, J. (ed.) ESA 1999. LNCS, vol. 1643, pp. 426–437. Springer, Heidelberg (1999)

    Google Scholar 

  24. Wolff, A.: The Map-Labeling Bibliography (1996), http://i11www.ira.uka.de/map-labeling/bibliography/

  25. Wagner, F.: Approximate map labeling is in Omega (n log n). Technical Report B 93-18, Fachbereich Mathematik und Informatik, Freie Universitat Berlin (1993)

    Google Scholar 

  26. Wagner, F., Wolff, A.: Map labeling heuristics: provably good and practically useful. In: Proceedings of the eleventh annual symposium on Computational geometry, pp. 109–118 (1995)

    Google Scholar 

  27. Wagner, F., Wolff, A.: A combinatorial framework for map labeling. In: Whitesides, S.H. (ed.) GD 1998. LNCS, vol. 1547, pp. 316–331. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  28. Yoeli, P.: The Logic of Automated Map Lettering. The Cartographic Journal 9, 99–108 (1972)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Wilhelm-Schickard-Institut für Informatik, Universität Tübingen, 72116, Tübingen, Germany

    Michael Kaufmann

Authors
  1. Michael Kaufmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institut für Informatik, Universität Freiburg, Georges-Köhler-Allee 79, 79110, Freiburg, Germany

    Susanne Albers

  2. Institut für Informatik, Freie Universität Berlin, Takustr. 9, 14195, Berlin, Germany

    Helmut Alt

  3. Fachbereich IV - Informatik, Universität Trier, 54286, Trier, Germany

    Stefan Näher

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Kaufmann, M. (2009). On Map Labeling with Leaders. In: Albers, S., Alt, H., Näher, S. (eds) Efficient Algorithms. Lecture Notes in Computer Science, vol 5760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03456-5_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-03456-5_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-03455-8

  • Online ISBN: 978-3-642-03456-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation