Minimum point-overlap labeling
From MaRDI portal
Publication:5283379
Recommendations
Cites work
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Approximation algorithms for free-label maximization
- Approximation algorithms for maximum independent set of pseudo-disks
- Approximation algorithms on consistent dynamic map labeling
- Consistent labeling of rotating maps
- Dynamic point labeling is strongly PSPACE-complete
- LABELING POINTS WITH CIRCLES
- Label placement by maximum independent set in rectangles
- Labeling moving points with a trade-off between label speed and label overlap
- Labeling points with given rectangles
- Optimizing active ranges for consistent dynamic map labeling
- Point labeling with sliding labels
- Trajectory-based dynamic map labeling
Cited in
(6)- Solving dynamic labeling problems to optimality using solution space reductions
- Minimum point-overlap labelling*
- Approximation algorithms for free-label maximization
- Approximation algorithms for free-label maximization
- Consistent dynamic map labeling with fairness and importance
- Minimal on-line labelling
This page was built for publication: Minimum point-overlap labeling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5283379)