Three rules suffice for good label placement

Algorithmica (New York)

Volumn 30, Issue 2, 2001, Pages 334-349

  Wagner, F ^a   Wolff, A ^b   Kapoor, V ^a   Strijk, T ^c  

^a FREIE UNIVERSITÄT BERLIN   (Germany)

^b UNIVERSITY OF GREIFSWALD   (Germany)

^c UTRECHT UNIVERSITY   (Netherlands)

Author keywords

Cartography; Computational geometry; Experimental comparison; Label placement algorithms

Indexed keywords

ALGORITHMS; GRAPH THEORY; MAPPING; PROBLEM SOLVING;

LABEL-PLACEMENT ALGORITHMS;

COMPUTATIONAL GEOMETRY;

EID: 0141981892     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-001-0009-7     Document Type: Article

References (19)

1. Pankaj K. 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, Joe Marks, and Stuart Shieber. An empirical study of algorithms for point-feature label placement. ACM Transactions on Graphics, 14(3):203-232, 1995.
3. 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.
4. Michael Formann and Frank Wagner. A packing problem with applications to lettering of maps. In Proceedings of the 7th Annual ACM Symposium on Computational Geometry, pages 281-288, 1991.
5. Robert J. Fowler, Michael S. Paterson, and Steven L. Tanimoto. Optimal packing and covering in the plane are NP-complete. Information Processing Letters, 12(3): 133-137, 1981.
6. Herbert Freeman. An expert system for the automatic placement of names on a geographic map. Infor-mation Sciences, 45:367-378, 1988.
7. Stephen A. Hirsch. An algorithm for automatic name placement around point data. The American Cartographer, 9(1):5-17, 1982.
8. Eduard Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
9. Konstantinos G. Kakoulis and Ionnis G. Tollis. A unified approach to labeling graphical features. In Proceedings of the 14th Annual ACM Symposium on Computational Geometry, pages 347-356, June 1998.
10. Donald E. Knuth and Arvind Raghunathan. The problem of compatible representatives. SIAM Journal on Discrete Mathematics, 5(3):422-427, 1992.
11. Stefan Näher and Kurt Mehlhom. LEDA: A library of efficient data types and algorithms. In Proceedings of the Internat. Colloqium on Automata Language Programming, pages 1-5, 1990.
12. Tycho Strijk and Marc van Kreveld. Practical extensions of point labeling in the slider model. In Proceedings of the 7th ACM Symposium on Advances in Geographic Information Systems, pages 47-52, 5-6 November 1999.
13. Marc van Kreveld, Tycho Strijk, and Alexander Wolff. Point labeling with sliding labels. Computational Geometry: Theory and Applications, 13:21-47, 1999.
14. Frank Wagner. Approximate map labeling is in Ω (n log n). Information Processing Letters, 52(3): 161-165, 1994.
15. Frank Wagner and Alexander Wolff. A practical map labeling algorithm. Computational Geometry: Theory and Applications, 7:387-404, 1997.
16. Frank Wagner and Alexander Wolff. A combinatorial framework for map labeling. In Sue H. Whitesides, editor, Proceedings of the Symposium on Graph Drawing '98, volume 1547 of Lecture Notes in Computer Science, pages 316-331. Springer-Verlag, Berlin, 1998.
17. Alexander Wolff. Label Placement in Theory and Practice. Ph.D. thesis, Fachbereich Mathematik und Informatik, Freie Universität Berlin, May 1999.
18. Chyan Victor Wu and Barbara Pfeil Buttenfield. Reconsidering rules for point-feature name placement. Cartographica, 28(1):10-27, 1991.
19. Steven Zoraster. The solution of large 0-1 integer programming problems encountered in automated cartography. Operations Research, 38(5):752-759, 1990.