On the complexity of the Edge Label Placement problem

Computational Geometry: Theory and Applications

Volumn 18, Issue 1, 2001, Pages 1-17

  Kakoulis, Konstantinos G ^a   Tollis, Ioannis G ^a  

^a The University of Texas at Dallas   (United States)

Author keywords

Automated label placement; Cartography; Edge labeling; Graph drawing; NP hard

Indexed keywords

EID: 0012475863     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(00)00025-0     Document Type: Article

References (18)

1. Ahn J., Freeman H. A program for automatic name placement. Cartographica. 21:(2-3):1984;101-109.
2. Chazelle B. et al. Application challenges to computational geometry: CG impact task force report, Technical Report TR-521-96. April 1996;Princeton University.
3. Christensen J., Marks J., Shieber S. An empirical study of algorithms for Point Feature Label Placement. ACM Trans. Graphics. 14:(3):1995;203-232.
4. Edmondson S., Christensen J., Marks J., Shieber S. A general cartographic labeling algorithm. Cartographica. 33:(4):1997;321-342.
5. Formann M., Wagner F. A packing problem with applications to lettering of maps. Proc. 7th Annual ACM Sympos. Comput. Geom. 1991;281-288.
6. Freeman H. Computer name placement. Maguire D.J., Goodchild M.F., Rhind D.W. Geographical Information Systems: Principles and Applications. 1991;445-456 Longman, London.
7. Garey M.R., Johnson D.S. Computer and Intractability: A Guide to the Theory of NP-Completeness. 1979;W.H. Freeman, New York.
8. Imhof E. Positioning names on maps. The American Cartographer. 2:(2):1975;128-144.
9. Kakoulis K.G., Tollis I.G. An algorithm for labeling edges of hierarchical drawings. Di Battista G. Graph Drawing (Proc. GD '97). Lecture Notes in Computer Science. 1353:1998;168-180 Springer, Berlin.
10. Kakoulis K.G., Tollis I.G. A unified approach to labeling graphical features. Proc. 14th Annual ACM Sympos. in Computational Geometry. June 1998;356-347.
11. Kato T., Imai H. 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. 1988;11-18. in Japanese.
12. Knuth D., Raghunathan A. The problem of compatible representatives. SIAM J. Discrete Math. 5:1992;36-47.
13. J. Marks, Personal communication, 1996.
14. Marks J., Shieber S. The computational complexity of cartographic label placement, Technical Report 05-91. 1991;Harvard University.
15. Robinson A.H., Morrison J.L., Muehrcke P.C., Kimerling A.J., Guptill S.C. Elements of Cartography. 6th Edition :1995;Willey, New York.
16. Tollis I.G. Graph drawing and information visualization. ACM Comput. Surveys. 28A:(4):1996.
17. Wolff A. Edge labeling is NP-hard, Technical Report 11/2000. September 2000;Institute of Mathematics and Computer Science, Ernst Moritz Arndt University Greifswald.
18. Yoeli P. The logic of automated map lettering. The Cartographic Journal. 9:(2):1972;99-108.