Placing labels in road maps: algorithms and complexity

DOI10.1007/s00453-020-00678-7zbMath1441.68182OpenAlexW3004346878MaRDI QIDQ2182092

Martin Nöllenburg, Benjamin Niedermann, Andreas Gemsa

Publication date: 21 May 2020

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-020-00678-7

zbMATH Keywords

NP-hardnessmap labelingroad mapsefficient tree-based algorithm

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites Work

• Unnamed Item
• The hardness of placing street names in a Manhattan type map
• Planar Formulae and Their Uses
• LABELING POINTS WITH CIRCLES

This page was built for publication: Placing labels in road maps: algorithms and complexity