论文信息 - Label Placement in Road Maps

Label Placement in Road Maps

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.

[1] Rüdiger Westermann,et al. Temporally coherent real-time labeling of dynamic scenes , 2012, COM.Geo '12.

[2] Joe Marks,et al. A General Cartographic Labeling Algorithm , 1996 .

[3] Gabriele Neyer,et al. Labeling Downtown , 2000, CIAC.

[4] A. Hernández-Vásquez,et al. [Geographic information systems]. , 2016, Revista peruana de medicina experimental y salud publica.

[5] Tomio Hirata,et al. Approximation algorithms for the weighted independent set problem in sparse graphs , 2009, Discret. Appl. Math..

[6] David Lichtenstein,et al. Planar Formulae and Their Uses , 1982, SIAM J. Comput..

[7] François Chirié. Automated Name Placement With High Cartographic Quality: City Street Maps , 2000 .

[8] T. Bernhardsen. Geographic Information Systems: An Introduction , 1999 .

[9] Jürgen Döllner,et al. Embedded labels for line features in interactive 3D virtual environments , 2007, AFRIGRAPH '07.

[10] E. Imhof. Positioning Names on Maps , 1975 .

[11] Sebastian Seibert,et al. The hardness of placing street names in a Manhattan type map , 2000, Theor. Comput. Sci..

[12] Alexander Wolff,et al. A simple and efficient algorithm for high-quality line labeling , 2001 .

[13] A. Reimer,et al. Point-feature lettering of high cartographic quality : A multi-criteria model with practical implementation , 2014 .