Combining Traditional Map Labeling with Boundary Labeling

  • Michael A. Bekos
  • Michael Kaufmann
  • Dimitrios Papadopoulos
  • Antonios Symvonis
Conference paper

DOI: 10.1007/978-3-642-18381-2_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6543)
Cite this paper as:
Bekos M.A., Kaufmann M., Papadopoulos D., Symvonis A. (2011) Combining Traditional Map Labeling with Boundary Labeling. In: Černá I. et al. (eds) SOFSEM 2011: Theory and Practice of Computer Science. SOFSEM 2011. Lecture Notes in Computer Science, vol 6543. Springer, Berlin, Heidelberg

Abstract

The traditional map labeling problems are mostly \({\mathcal{NP}}\)-hard. Hence, effective heuristics and approximations have been developed in the past. Recently, efficient algorithms for the so-called boundary labeling model have been introduced which assumes that the labels are placed on the boundary of the map and connected by polygonal leaders to their corresponding sites. Internal labels have been forbidden. In this paper, we allow both. Since clearly internal labels should be preferred, we consider several maximization problems for the number of internal labels and we show that they can be obtained efficiently or in quasi-polynomial time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael A. Bekos
    • 1
  • Michael Kaufmann
    • 2
  • Dimitrios Papadopoulos
    • 1
  • Antonios Symvonis
    • 1
  1. 1.School of Applied Mathematical & Physical SciencesNational Technical University of AthensGreece
  2. 2.Institute for InformaticsUniversity of TübingenGermany

Personalised recommendations