Consistent labeling of rotating maps
DOI10.1007/978-3-642-22300-6_38zbMATH Open1342.68336OpenAlexW2169420763MaRDI QIDQ5199264FDOQ5199264
Authors: Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter 
Publication date: 12 August 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://publikationen.bibliothek.kit.edu/1000083097/13774104
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cited In (14)
- Minimum point-overlap labelling*
- Approximation algorithms for free-label maximization
- Dynamic point labeling is strongly PSPACE-complete
- Evaluation of labeling strategies for rotating maps
- A unified model and algorithms for temporal map labeling
- Optimizing active ranges for consistent dynamic map labeling
- Title not available (Why is that?)
- Mixed Map Labeling
- Maximizing the number of visible labels on a rotating map
- Consistent labeling of rotating maps
- Fast optimal labelings for rotating maps
- Trajectory-based dynamic map labeling
- Approximation algorithms on consistent dynamic map labeling
- Solving dynamic labeling problems to optimality using solution space reductions
This page was built for publication: Consistent labeling of rotating maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5199264)
