An Algorithmic Framework for Labeling Network Maps
Drawing network maps automatically comprises two challenging steps, namely laying out the map and placing non-overlapping labels. In this paper we tackle the problem of labeling an already existing network map considering the application of metro maps. We present a flexible and versatile labeling model. Despite its simplicity, we prove that it is NP-complete to label a single line of the network. For a restricted variant of that model, we introduce an efficient algorithm that optimally labels a single line. Based on that algorithm, we present a general and sophisticated workflow for multiple metro lines, which is experimentally evaluated on real-world metro maps.
KeywordsFull Version Simple Polygon Incoming Edge Algorithmic Framework Transitivity Property
Unable to display preview. Download preview PDF.
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009)Google Scholar
- 5.Formann, M., Wagner, F.: A packing problem with applications to lettering of maps. In: ACM Sympos. on Comput. Geom., pp. 281–288 (1991)Google Scholar
- 7.Haunert, J.-H., Niedermann, B.: An algorithmic framework for labeling network maps (2015). CoRR, abs/1505.00164Google Scholar
- 8.Imhof, E.: Positioning names on maps. Am. Cartographer, 128–144 (1975)Google Scholar
- 14.Wolff, A.: Graph drawing and cartography. In: Tamassia, R. (ed.) Handbook of Graph Drawing and Visualization, chapter 23, pp. 697–736. CRC Press (2013)Google Scholar