Label placement in road maps
From MaRDI portal
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.
Recommendations
Cites work
Cited in
(7)- The hardness of placing street names in a Manhattan type map
- Placing labels in road maps: algorithms and complexity
- scientific article; zbMATH DE number 1629850 (Why is no real title available?)
- Models and methods for cartographic label placement
- Label placement in road maps
- Mixed Map Labeling
- On the complexity of the Edge Label Placement problem
This page was built for publication: Label placement in road maps
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947022)