A unified approach to automatic label placement

International Journal of Computational Geometry and Applications

Volumn 13, Issue 1, 2003, Pages 23-59

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

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

Author keywords

Automated label placement; Cartography; Graph drawing; Map labeling

Indexed keywords

EID: 0037298011     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195903001062     Document Type: Conference Paper

References (41)

1. C. Berge. Two theorems in graph theory. In Proc. Natl. Acad. Sci., 43, pages 842-844, 1957.
2. D. Beus and D. Crockett. Automated production of 1:24,000 scale quadrangle maps. In Proc. 1994 ASPRS/ACSM Ann. Convention and Exposition, volume 1, pages 94-99, 1994.
3. R. Castello, R. Mili, and I.G. Tollis. An Algorithmic Framework for Visualizing Statecharts. In J. Marks, editor, Graph Drawing (Proc. GD 2000), volume 1184 of Lecture Notes in Computer Science, pages 139-149. Springer-Verlag, 2000.
4. G. Chartrand and O. R. Oellermann. Applied and Algorithmic Graph Theory. McGraw-Hill, New York, 1993.
5. B. Chazelle et al. Application challenges to computational geometry: CG impact task force report. Technical Report TR-521-96, Princeton Univ., April 1996.
6. 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.
7. 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.
8. G. Di Battista, P. Eades, R. Tamassia, and I. G. Tollis. Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, 1998.
9. G. Di Battista, A. Garg, G. Liotta, R. Tamassia, E. Tassinari, and F. Vargiu. An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. Theory Appl., 7(5-6):303-325, 1997.
10. S. Doddi, M. V. Marathe, A. Mirzaian, B. M. Moret, and B. Zhu. Map Labeling and Its Generalizations. In Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, pages 148-157, 1997.
11. J. S. Doerschler and H. Freeman. A rule based system for dense map name placement. Communications of ACM, 35(1):68-79, 1992.
12. L. R. Ebinger and A. M. Goulete. Noninteractive automated names placement for the 1990 decennial census. Cartography and Geographic Informaton Systems, 17(1):69-78, January 1990.
13. H. Edelsbrunner. A new approach to rectangle intersections, Part I. Internat. J. Comput. Math., 13:209-219, 1983.
14. H. Edelsbrunner. A new approach to rectangle intersections, Part II. Internat. J. Comput. Math., 13:221-229, 1983.
15. S. Edmondson, J. Christensen, J. Marks, and S. Shieber. A General Cartographic Labeling Algorithm. Cartographica, 33(4):321-342, 1997.
16. S. Even. Graph Algorithms. Computer Science Press, Potomac, Maryland, 1979.
17. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annual ACM Sympos. Comput. Geom., pages 281-288, 1991.
18. H. Freeman. An Expert System for the Automatic Placement of Names on a Geographic Map. Information Sciences, 45:367-378, 1988.
19. H. Freeman. Computer name placement. In D. J. Maguire, M. F. Goodchild, and D. W. Rhind, editors, Geographical Information Systems: Principles and Applications, pages 445-456. Longman, London, 1991.
20. H. Freeman and J. Ahn. On the problem of placing names in a geographical map. Int. J. of Pattern Rec. and Artificial Intelligence, 1(1):121-140, 1987.
21. A. V. Goldberg and R. Kennedy. An Efficient Cost Scaling Algorithm for the Assignment Problem. Mathematical Programming, 71:153-178, December 1995.
22. P. Gupta, R. Janardan, and M. Smid. Efficient Algorithms for Counting and Reporting Pairwise Intersections between Convex Polygons. In Proc. 8th Canadian Conference on Computational Geometry, pages 8-13. Carleton University Press, 1996.
23. S. A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5-17, 1982.
24. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
25. K. G. Kakoulis. Algorithms for Automatic Placement of Labels in Drawings and Maps. Ph.D. thesis, Dept. Comput. Sci., The University of Texas at Dallas, Richardson, TX, August 1998.
26. K. G. Kakoulis and I. G. Tollis. An Algorithm for Labeling Edges of Hierarchical Drawings. In G. Di Battista, editor, Graph Drawing (Proc. GD '97), volume 1353 of Lecture Notes in Computer Science, pages 169-180. Springer-Verlag, 1998.
27. K. G. Kakoulis and I. G. Tollis. A Unified Approach to Labeling Graphical Features. In Proc. 14th Annual ACM Sympos. in Computational Geometry, pages 347-356, June 1998.
28. K. G. Kakoulis and I. G. Tollis. On the Complexity of the Edge Label Placement Problem. Comput. Geom. Theory and Appl., 18:1-17, 2001.
29. 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.
30. D. Knuth and A. Raghunathan. The problem of compatible representatives. SIAM J. Disc. Math., 5:36-47, 1992.
31. J. Marks. Personal communication, 1996.
32. J. Marks and S. Shieber. The computational complexity of cartographic label placement. Technical Report 05-91, Harvard University, 1991.
33. K. Mehlhorn and S. Näher. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38:96-102, 1995.
34. I. Pinto and H. Freeman. The Feedback Approach to Cartographic Area Text Placement. In P. Perner, P. Wang, and A. Rosenfeld, editors, Advances in Structural and Syntactical Pattern Recognition, volume 1121 of Lecture Notes in Computer Science, pages 341-350. Springer-Verlag, 1996.
35. A. H. Robinson, J. L. Morrison, P. C. Muehrcke, A. J. Kimerling, and S. C. Guptill. Elements of Cartography. John Willey & Sons, Inc., (pages 420-421), 6th edition, 1995.
36. Tom Sawyer Software. Graph Layout Toolkit User's Guide. Berkeley, CA, 1992-1998.
37. 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.
38. J. W. van Roessel. An algorithm for locating candidate labeling boxes within a polygon. The American Cartographer, 16(3):201-209, 1989.
39. Frank Wagner and Alexander Wolff. Map labeling heuristics: Provably good and practically useful. In Proc. 11th Annual. ACM Sympos. Comput. Geom., pages 109-118, 1995.
40. P. Yoeli. The logic of automated map lettering. The Cartographic Journal, 9(2):99-108, 12 1972.
41. S. Zoraster. The solution of large 0-1 integer programming problems encountered in automated cartography. Operation Research, 38(5):752-759, September-October 1990.