Minimum point-overlap labeling
From MaRDI portal
Publication:5283379
DOI10.1007/978-3-319-57586-5_28zbMATH Open1486.68254OpenAlexW3164685427MaRDI QIDQ5283379FDOQ5283379
Keiko Imai, Noriyoshi Sukegawa, Yusuke Matsumoto, Yuya Higashikawa, Yusuke Yokosuka
Publication date: 21 July 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-57586-5_28
Recommendations
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)
Cites Work
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Point labeling with sliding labels
- Labeling points with given rectangles
- Label placement by maximum independent set in rectangles
- Approximation algorithms for free-label maximization
- Optimizing active ranges for consistent dynamic map labeling
- Approximation algorithms for maximum independent set of pseudo-disks
- LABELING POINTS WITH CIRCLES
- Labeling Moving Points with a Trade-Off between Label Speed and Label Overlap
- Consistent labeling of rotating maps
- DYNAMIC POINT LABELING IS STRONGLY PSPACE-COMPLETE
- Approximation algorithms on consistent dynamic map labeling
- Trajectory-Based Dynamic Map Labeling
Cited In (4)
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)