Algorithms for Multi-criteria One-Sided Boundary Labeling

DOI10.1007/978-3-540-77537-9_25MaRDI QIDQ5452228zbMATH OpenOpenAlexFDO

Authors Marc Benkert, Moritz Kroll, Martin Nöllenburg, Herman Haverkort

Publication date 25 March 2008

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-77537-9_25

Mathematics Subject Classification ID

Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Algorithms for Multi-Criteria Boundary Labeling
• Multi-sided boundary labeling
• Boundary labeling for rectangular diagrams
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Many-to-One Boundary Labeling

Cites work

• Boundary labeling: Models and efficient algorithms for rectangular maps
• LABELING POINTS WITH CIRCLES
• Multi-stack Boundary Labeling Problems

Cited in

(8)

• Combining traditional map labeling with boundary labeling
• Algorithms for Multi-Criteria Boundary Labeling
• Boundary Labeling with Octilinear Leaders
• On Map Labeling with Leaders
• Connecting the dots (with minimum crossings)
• Boundary labeling in a circular orbit
• Quantum speedups for polynomial-time dynamic programming algorithms
• Boundary labeling with octilinear leaders

This page was built for publication: Algorithms for Multi-criteria One-Sided Boundary Labeling

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