Evaluation of labeling strategies for rotating maps
From MaRDI portal
Publication:5266612
Recommendations
Cites work
- Approximation Algorithms on Consistent Dynamic Map Labeling
- Approximation algorithms for free-label maximization
- Approximation schemes for covering and packing problems in image processing and VLSI
- Computational geometry. Algorithms and applications.
- Consistent labeling of rotating maps
- Dynamic point labeling is strongly PSPACE-complete
- Evaluation of labeling strategies for rotating maps
- Label placement by maximum independent set in rectangles
- Labeling moving points with a trade-off between label speed and label overlap
- Optimizing active ranges for consistent dynamic map labeling
- Point labeling with sliding labels
- Trajectory-based dynamic map labeling
- Union-copy structures and dynamic segment trees
Cited in
(13)- Solving dynamic labeling problems to optimality using solution space reductions
- Consistent labeling of rotating maps
- Fundamentals of Computation Theory
- Fast optimal labelings for rotating maps
- Consistent labeling of rotating maps
- The MaxIS-Shapley value in perfect graphs
- Mixed Map Labeling
- Labeling moving points with a trade-off between label speed and label overlap
- Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs
- Models and methods for cartographic label placement
- Maximizing the number of visible labels on a rotating map
- A unified model and algorithms for temporal map labeling
- Evaluation of labeling strategies for rotating maps
This page was built for publication: Evaluation of labeling strategies for rotating maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266612)