An algorithm for labeling edges of hierarchical drawings

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1353, Issue , 1997, Pages 169-180

  Kakoulis, Konstaatinos G ^a   Tollis, Ioannis G ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

DRAWING (GRAPHICS); MAPS;

DRAWING STYLES; EDGE LABELS; TEXT LABELS;

ALGORITHMS;

EID: 84957375800     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63938-1_60     Document Type: Conference Paper

References (20)

1. J. Ahn and H. Freeman. A program for automatic name placement. Cartographica, 21(5 & 3):101-109, Summer & Autumn 1984.
2. C. Berge. Two theorems in graph theory. In Proc. Natl. Acad. Sci., 43, pages 842-844, 1957.
3. 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.
4. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Algorithms for drawing graphs: an annotated bibliography. Comput. Geom. Theory Appl., 4:235-282, 1994.
5. G. Di Battista, A. Gary, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An experimental comparison of four graph drawing algorithms. Comput. Geom. Theory Appl., 1996. to appear.
6. L. R. Ebinger and A. M. Goulete. Noninteraetive automated names placement for the 1990 decennial census. Cartography and Geographic Informaton Systems, 17(1):69-78, January 1990.
7. ACM Computational Geometry Impact Task Force. Application challenges to computational geometry. Technical Report TR-521-96, Princeton Univ., 1996.
8. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 281-288, 1991.
9. A. V. Goldberg and R. Kennedy. An Efficient Cost Scaling Algorithm for the Assignment Problem. Mathematical Programming, 71:153-178, December 1995.
10. S. A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5-17, 1982.
11. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
12. K.G. Kakoulis and I.G. Tollis. On the Edge Label Placement Problem. In S. North, editor, Graph Drawing (Proc., GD '96), volume 1190 of Lecture Notes in Computer Science, pages 241-256. Springer-Verlag, 1997.
13. T. Kato and H. Imai. The NP-completeness of the character placement problem of 2 or 3 degrees of freedom. In Record of Joint Conference of Electrical and Electronic Engineers in Kyushu, pages 11-18, 1988. in Japanese.
14. J. Marks. Personal communication, 1996.
15. J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report 05-91, Harvard University, 1991.
16. R. E. Tarjan. Data Structures and Network Algorithms, volume 44 of CBMS-NSF Regional Conference Series in Applied Mathematics. Society for Industrial Applied Mathematics, 1983.
17. I. G. Tollis. Graph Drawing and Information Visualization. ACM Computing Surveys, 28A(4), 1996.
18. F. Wagner and A. Wolff. Map labeling heuristics: Provably good and practically useful. In Proc. 11th Anrtu. ACM Sympos. Comput. Geom., pages 109-118, 1995.
19. P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 12 1972.
20. S. Zoraster. The solution of large 0-1 integer programming problems encountered in automated cartography. Operation Research, 38(5):752-759, September-October 1990.