Maximizing the number of visible labels on a rotating map

DOI10.7561/SACS.2021.2.293MaRDI QIDQ5089625zbMATH OpenFDO

Authors Ali Gholami Rudi

Publication date 19 July 2022

Published in Scientific Annals of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7561/SACS.2021.2.293

zbMATH Keywords

computational geometrygeometric independent setmap labellingpolynomial-time approximation schemerotating maps

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

Recommendations

• Consistent labeling of rotating maps
• Consistent labeling of rotating maps
• Fast optimal labelings for rotating maps
• Evaluation of labeling strategies for rotating maps
• POINT SET LABELING WITH SPECIFIED POSITIONS

Cited in

(6)

• Consistent labeling of rotating maps
• Fast optimal labelings for rotating maps
• Consistent labeling of rotating maps
• Evaluation of labeling strategies for rotating maps
• Graph Drawing
• Maximum centre-disjoint mergeable disks

This page was built for publication: Maximizing the number of visible labels on a rotating map

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089625)