A unified model and algorithms for temporal map labeling
DOI10.1007/s00453-020-00694-7zbMath1460.68123OpenAlexW3015815083MaRDI QIDQ2006937
Andreas Gemsa, Benjamin Niedermann, Martin Nöllenburg
Publication date: 12 October 2020
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-020-00694-7
dynamic programmingapproximation algorithmspolynomial-time algorithmscomplexity resultsdynamic map labelinggeometric packing algorithmsunified map labeling model
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Cites Work
- Unnamed Item
- Unnamed Item
- Optimal packing and covering in the plane are NP-complete
- An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
- On the \(k\)-coloring of intervals
- Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
- On the Readability of Boundary Labeling
- Consistent labeling of rotating maps
- Approximation Algorithms on Consistent Dynamic Map Labeling
- DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE
- Evaluation of Labeling Strategies for Rotating Maps
- Algorithms – ESA 2005
- Optimizing active ranges for consistent dynamic map labeling
This page was built for publication: A unified model and algorithms for temporal map labeling
