Approximation algorithms for free-label maximization

DOI10.1016/j.comgeo.2011.10.004zbMath1242.65042OpenAlexW2030174981MaRDI QIDQ419365

Dirk H. P. Gerrits, Mark T. de Berg

Publication date: 18 May 2012

Published in: Computational Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comgeo.2011.10.004

zbMATH Keywords

algorithmsmoving objectsair-traffic controlmap labelingfree-label maximizationlabel-placement modelspoint-labeling problem

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Minimum Point-Overlap Labeling ⋮ Solving dynamic labeling problems to optimality using solution space reductions ⋮ Minimum point-overlap labelling* ⋮ Evaluation of Labeling Strategies for Rotating Maps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on maximum independent sets in rectangle intersection graphs
• Optimal packing and covering in the plane are NP-complete
• Point labeling with sliding labels
• Labeling points with weights
• Approximation Algorithms for Free-Label Maximization
• Constructing Arrangements of Lines and Hyperplanes with Applications
• Approximation schemes for covering and packing problems in image processing and VLSI
• Trimming of Graphs, with Application to Point Labeling
• Consistent Labeling of Rotating Maps
• Algorithms and Computation
• Optimizing active ranges for consistent dynamic map labeling