Label Placement in Road Maps
Computational Geometry
2015-01-29 v1 Data Structures and Algorithms
Abstract
A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along the edges so that as many road sections as possible are identified by their name, i.e., covered by a label. We show that this is NP-hard in general, but the problem can be solved in polynomial time if the road map is an embedded tree.
Cite
@article{arxiv.1501.07188,
title = {Label Placement in Road Maps},
author = {Andreas Gemsa and Benjamin Niedermann and Martin Nöllenburg},
journal= {arXiv preprint arXiv:1501.07188},
year = {2015}
}
Comments
extended version of a CIAC 2015 paper