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. © 2013 Springer-Verlag.
CITATION STYLE
Gemsa, A., Niedermann, B., & Nöllenburg, M. (2013). Trajectory-based dynamic map labeling. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8283 LNCS, pp. 413–423). https://doi.org/10.1007/978-3-642-45030-3_39
Mendeley helps you to discover research relevant for your work.