In this paper we introduce trajectory-based labeling, a new variant of dynamic map labeling, where a movement trajectory for the map viewport is given. We define a general labeling model and study the active range maximization problem in this model. The problem is NP-complete and W[1]-hard. In the restricted, yet practically relevant case that no more than k labels can be active at any time, we give polynomial-time algorithms. For the general case we present a practical ILP formulation with an experimental evaluation as well as approximation algorithms.
@article{arxiv.1309.3963,
title = {Trajectory-Based Dynamic Map Labeling},
author = {Andreas Gemsa and Benjamin Niedermann and Martin Nöllenburg},
journal= {arXiv preprint arXiv:1309.3963},
year = {2013}
}
Comments
19 pages, 7 figures, extended version of a paper to appear at ISAAC 2013