Trajectory-based dynamic map labeling
From MaRDI portal
Abstract: 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.
Recommendations
Cited in
(10)- A unified model and algorithms for temporal map labeling
- Consistent dynamic map labeling with fairness and importance
- Solving dynamic labeling problems to optimality using solution space reductions
- Labeling moving points with a trade-off between label speed and label overlap
- Placing arrows in directed graph drawings
- Minimum point-overlap labelling*
- Dynamic point labeling is strongly PSPACE-complete
- Evaluation of labeling strategies for rotating maps
- Minimum point-overlap labeling
- Quantum speedups for polynomial-time dynamic programming algorithms
This page was built for publication: Trajectory-based dynamic map labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2872105)