Point labeling with sliding labels

Computational Geometry: Theory and Applications

Volumn 13, Issue 1, 1999, Pages 21-47

  Van Kreveld, Marc ^a   Strijk, Tycho ^a   Wolff, Alexander ^b  

^a UTRECHT UNIVERSITY   (Netherlands)

^b FREIE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Approximation scheme; Greedy approximation algorithm; Map labeling; Point annotation

Indexed keywords

EID: 0002254288     PISSN: 09257721     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0925-7721(99)00005-X     Document Type: Article

References (23)

1. P. Agarwal, M. van Kreveld, S. Suri, Label placement by maximum independent set in rectangles, in: Proceedings of the 9th Canadian Conference on Computational Geometry, 1997, pp. 233-238.
2. T.C. Bailey, A.C. Gatrell, Interactive Spatial Data Analysis, Longman, Harlow, 1995.
3. B. Chazelle et al., Application challenges to computational geometry: CG impact task force report, April 1996, http://www.cs.princeton.edu/~chazelle/taskforce/CGreport.ps.
4. J. Christensen, J. Marks, S. Shieber, An empirical study of algorithms for point-feature label placement, ACM Trans. Graphics 14 (3) (1995) 203-232.
5. T.H. Cormen, C.E. Leiserson, R.L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA, 1990.
6. M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer, Berlin, 1997.
7. S. Doddi, M.V. Marathe, A. Mirzaian, B.M.E. Moret, B. Zhu, Map labeling and its generalizations, in: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, 1997, pp. 148-157.
8. J.S. Doerschler, H. Freeman, A rule-based system for dense-map name placement, Commun. ACM 35 (1992) 68-79.
9. M. Formann, Frank Wagner, A packing problem with applications to lettering of maps, in: Proc. of the 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 281-288.
10. R.J. Fowler, M.S. Paterson, S.L. Tanimoto, Optimal packing and covering in the plane are NP-complete, Inform. Process. Lett. 12 (3) (1981) 133-137.
11. S.A. Hirsch, An algorithm for automatic name placement around point data, The American Cartographer 9 (1) (1982) 5-17.
12. E. Imhof, Positioning names on maps, The American Cartographer 2 (2) (1975) 128-144.
13. E.H. Isaaks, R.M Srivastava, An Introduction to Applied Geostatistics, Oxford University Press, New York, 1989.
14. C. Iturriaga, A. Lubiw, NP-hardness of some map labeling problems, Technical Report CS-97-18, University of Waterloo, Canada, 1997.
15. D.E. Knuth, A. Raghunathan, The problem of compatible representatives, SIAM J. Discrete Math. 5 (3) (1992) 422-427.
16. D. Lichtenstein, Planar formulae and their uses, SIAM J. Comput. 11 (2) (1982) 329-343.
17. J. Marks, S. Shieber, The computational complexity of cartographic label placement, Technical Report TR-05-91, Harvard CS, 1991.
18. E.M. McCreight, Priority search trees, SIAM J. Comput. 14 (1985) 257-276.
19. K. Mehlhorn, S. Näher, LEDA: a platform for combinatorial and geometric computing, Comm. ACM 38 (1995) 96-102.
20. F. Wagner, A. Wolff, Map labeling heuristics: Provably good and practically useful, in: Proc. of the 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 109-118.
21. F. Wagner, A. Wolff, A practical map labeling algorithm, Computational Geometry 7 (5-6) (1997) 387-404.
22. A. Wolff, T. Strijk, A map labeling bibliography, 1996, http://www.inf.fu-berlin.de/map-labeling/bibliography/.
23. P. Yoeli, The logic of automated map lettering, The Cartographic Journal 9 (1972) 99-108.