Approximation Algorithms on Consistent Dynamic Map Labeling

We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ranges is maximized. We propose approximation algor...

Full description

Saved in:
Bibliographic Details
Published inFrontiers in Algorithmics pp. 170 - 181
Main Authors Liao, Chung-Shou, Liang, Chih-Wei, Poon, Sheung-Hung
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Active Range
Approximation Algorithm
Consistent Dynamic
Consistent Label
Prism Pair
Online AccessGet full text

Cover

More Information
Summary:We consider the dynamic map labeling problem: given a set of rectangular labels on the map, the goal is to appropriately select visible ranges for all the labels such that no two consistent labels overlap at every scale and the sum of total visible ranges is maximized. We propose approximation algorithms for several variants of this problem. For the simple ARO problem, we provide a 3c logn-approximation algorithm for the unit-width rectangular labels if there is a c-approximation algorithm for unit-width label placement problem in the plane; and a randomized polynomial-time O(logn loglogn)-approximation algorithm for arbitrary rectangular labels. For the general ARO problem, we prove that it is NP-complete even for congruent square labels with equal selectable scale range. Moreover, we contribute 12-approximation algorithms for both arbitrary square labels and unit-width rectangular labels, and a 6-approximation algorithm for congruent square labels.
ISBN:9783319080154
3319080156
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-08016-1_16