A combinatorial framework for map labeling

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

Volumn 1547, Issue , 1999, Pages 316-331

  Wagner, Frank ^a,b   Wolff, Alexander ^a,b  

^a Institut fr Informatik   (Germany)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957922936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-37623-2_24     Document Type: Conference Paper

References (17)

1. Pankaj Agarwal, Marc van Kreveld, and Subhash Suri. Label placement by maximum independent set in rectangles. In Proceedings of the 9th Canadian Conference on Computational Geometry, pages 233–238, 1997.
2. Jon Christensen, Stacy Friedman, Joe Marks, and Stuart Shieber. Empirical testing of algorithms for variable-sized label placement. In Proceedings of the 13th Annual ACM Symposium on Computational Geometry, pages 415–417, 1997.
3. Jon Christensen, Joe Marks, and Stuart Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203–232, 1995.
4. Srinivas Doddi, Madhav V. Marathe, Andy Mirzaian, Bernard M.E. Moret, and Binhai Zhu. Map labeling and its generalizations. In Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pages 148–157, 1997.
5. Robert J. Fowler, Michael S. Paterson, and Steven L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Inform. Process. Lett., 12(3):133–137, 1981.
6. Michael Formann and Frank Wagner. A packing problem with applica- tions to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom., pages 281–288, 1991.
7. Eugene C. Freuder and Richard J. Wallace. Partial constraint satisfaction. Jour. Artificial Intelligence, 58:21–70, 1992.
8. Stephen A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5–17, 1982.
9. Michael B. Jampel. Over-Constrained Systems in CLP and CSP. PhD thesis, Dept. of Comp. Sci. City University, London, sept 1996.
10. Michael Jampel, Eugene Freuder, and Michael Maher, editors. Over- Constrained Systems. Number 1106 in LNCS. Springer, August 1996.
11. Donald E. Knuth and Arvind Raghunathan. The problem of compatible representatives. SIAM J. Discr. Math., 5(3):422–427, 1992.
12. Konstantinos G. Kakoulis and Ionnis G. Tollis. A unified approach to labeling graphical features. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 347–356, June 1998.
13. Alan K. Mackworth and Eugene C. Freuder. The complexity of some poly-nomial network consistency algorithms for constraint satisfaction problems. Jour. Artificial Intelligence., 25:65–74, 1985.
14. Thomas Schiex, Hélène Fargier, and Gérard Verfaillie. Valued constraint satisfaction problems: Hard and easy problems. In Proc. International Joint Conference on AI, aug 1995.
15. Marc van Kreveld, Tycho Strijk, and Alexander Wolff. Point set labeling with sliding labels. In Proc. 14th Annu. ACM Sympos. Comput. Geom., pages 337–346, June 1998.
16. Frank Wagner. Approximate map labeling is in ?(nlog n). Information Processing Letters, 52(3):161–165, 1994.
17. Frank Wagner and Alexander Wolff. A practical map labeling algorithm. Computational Geometry: Theory and Applications, 7:387–404, 1997.