On the Readability of Boundary Labeling

DOI10.1007/978-3-319-27261-0_42zbMath1471.68183arXiv1509.00379OpenAlexW2174750381MaRDI QIDQ2959785

Andreas Gemsa, Lukas Barth, Benjamin Niedermann, Martin Nöllenburg

Publication date: 10 February 2017

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1509.00379

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A unified model and algorithms for temporal map labeling ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Boundary Labeling for Rectangular Diagrams

This page was built for publication: On the Readability of Boundary Labeling