Abstract
Let G(V, E) be a graph, and let f: G → R 2 be a one to one function that produces a layout of a graph G on the plane. We consider the problem of assigning text labels to every edge of the graph such that the quality of the labeling assignment is optimal. This problem has been first encountered in automated cartography and has been referred to as the Line Feature Label Placement (LFLP) problem. Even though much effort has been devoted over the last 15 years in the area of automated drawing of maps, the Edge Label Placement (ELP) problem has received little attention. In this paper we investigate computational complexity issues of the ELP problem, which have been open up to the present time. Specifically we prove that the ELP problem is NP-Hard.
Research supported in part by NIST, Advanced Technology Program grand number 70NANB5H1162.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Ahn, J. and H. Freeman, A program for automatic name placement. Cartographica, 2l(2&3), Summer & Autumn, 1994.
J. Christensen, J. Marks and S. Shieber, An empirical study of algorithms for Point Feature Label Placement. ACM Trans. on Graphics, 14(3):203–232, July, 1995.
Di Battista, G., Eades, P., Tamassia R., I. G. Tollis, Algorithms for Drawing Graphs: an Annotated Bibliography. Computational Geometry, Theory and Applications, 4(5), pp. 235–282, 1994.
Doerschler, J. S. and H. Freeman, A rule based system for dense map name placement. Communications of ACM, 35(1), pp. 68–79, January, 1992.
Ebinger, L. R. and A. M. Goulete, Noninteractive automated names placement for the 1990 decennial census. Cartography and Geographic Information Systems, 17(1), pp. 69–78, January, 1990.
M. Forman, F. Wagner, A packing problem with applications to lettering of maps. Proc. of 7-th Annual Symposium on Computational Geometry, pp. 281–288, 1991.
Herbert Freeman, An Expert System for the Automatic Placement of Names on a Geographical Map. Information Sciences, 45, pp. 367–378, 1988.
Freeman, H. an J. Ahn, On the problem of placing names in a geographical map. International Journal of Pattern Recognition and Artificial Intelligence, 1(1), pp. 121–140, 1987.
M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and company, NY, NY, 1979.
Eduard Imhof, Positioning names on maps. The American Cartographer, 2(2), pp. 128–144, 1975.
Kato, T. and H. Imai, The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, 1138, 1988. In Japanese.
J. Marks, private communication, 1996.
J. Marks, S. Shieber, The computational complexity of cartographic label placement. Technical Report 05-91, Harvard University, 1991.
J. W. van Roessel, An algorithm for locating candidate labeling boxes within a polygon. The American Cartographer, 16(3), pp. 201–209, 1989.
Pinhas Yoeli, The logic of automated map lettering. The Cartographic Journal, 9(2), pp. 99–108, December 1972.
S. Zoraster, The solution of large 0–1 integer programming problems encountered in automated cartography, Operation Research, 38(5), pp. 752–759, September–October, 1990.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kakoulis, K.G., Tollis, I.G. (1997). On the Edge Label Placement problem. In: North, S. (eds) Graph Drawing. GD 1996. Lecture Notes in Computer Science, vol 1190. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62495-3_52
Download citation
DOI: https://doi.org/10.1007/3-540-62495-3_52
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62495-0
Online ISBN: 978-3-540-68048-2
eBook Packages: Springer Book Archive