Conference proceeding
Combining Traditional Map Labeling with Boundary Labeling
SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, v 6543, pp 111-122
01 Jan 2011
Abstract
The traditional map labeling problems are mostly 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.
Metrics
Details
- Title
- Combining Traditional Map Labeling with Boundary Labeling
- Creators
- Michael A. Bekos - National Technical University of AthensMichael Kaufmann - University of TübingenDimitrios Papadopoulos - National Technical University of AthensAntonios Symvonis - National Technical University of Athens
- Publication Details
- SOFSEM 2011: THEORY AND PRACTICE OF COMPUTER SCIENCE, v 6543, pp 111-122
- Series
- Lecture Notes in Computer Science
- Publisher
- Springer Nature
- Number of pages
- 12
- Grant note
- National Technical University of Athens research program DEBE
- Resource Type
- Conference proceeding
- Language
- English
- Academic Unit
- Mathematics
- Web of Science ID
- WOS:000296264200009
- Scopus ID
- 2-s2.0-78751671023
- Other Identifier
- 991020531838904721
InCites Highlights
Data related to this publication, from InCites Benchmarking & Analytics tool:
- Collaboration types
- Domestic collaboration
- International collaboration
- Web of Science research areas
- Computer Science, Theory & Methods