Chapter

SOFSEM 2011: Theory and Practice of Computer Science

Volume 6543 of the series Lecture Notes in Computer Science pp 111-122

Combining Traditional Map Labeling with Boundary Labeling

  • Michael A. BekosAffiliated withCarnegie Mellon UniversitySchool of Applied Mathematical & Physical Sciences, National Technical University of Athens
  • , Michael KaufmannAffiliated withCarnegie Mellon UniversityInstitute for Informatics, University of Tübingen
  • , Dimitrios PapadopoulosAffiliated withCarnegie Mellon UniversitySchool of Applied Mathematical & Physical Sciences, National Technical University of Athens
  • , Antonios SymvonisAffiliated withCarnegie Mellon UniversitySchool of Applied Mathematical & Physical Sciences, National Technical University of Athens

* Final gross prices may vary according to local VAT.

Get Access

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.