Evaluation of Labeling Strategies for Rotating Maps

DOI10.1145/2851493zbMath1365.68442OpenAlexW151632460MaRDI QIDQ5266612

Andreas Gemsa, Martin Nöllenburg, Ignaz Rutter

Publication date: 16 June 2017

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2851493

zbMATH Keywords

experimental evaluationconsistency modeldynamic map labelingmap rotations

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (6)

Finding near-optimal independent sets at scale ⋮ Sublinear-space streaming algorithms for estimating graph parameters on sparse graphs ⋮ Fast Optimal Labelings for Rotating Maps ⋮ A unified model and algorithms for temporal map labeling ⋮ Solving dynamic labeling problems to optimality using solution space reductions ⋮ Evaluation of Labeling Strategies for Rotating Maps

Cites Work

• Unnamed Item
• Approximation algorithms for free-label maximization
• Label placement by maximum independent set in rectangles
• Point labeling with sliding labels
• Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
• Trajectory-Based Dynamic Map Labeling
• Union-copy structures and dynamic segment trees
• Approximation Algorithms on Consistent Dynamic Map Labeling
• Approximation schemes for covering and packing problems in image processing and VLSI
• Consistent Labeling of Rotating Maps
• DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE
• Evaluation of Labeling Strategies for Rotating Maps
• Optimizing active ranges for consistent dynamic map labeling

This page was built for publication: Evaluation of Labeling Strategies for Rotating Maps