Labeling points with circles

International Journal of Computational Geometry and Applications

Volumn 11, Issue 2, 2001, Pages 181-195

  Strijk, Tycho ^a   Wolff, Alexander ^a  

^a NONE

Author keywords

Automated label placement; Cartography; Computational geometry; Packing problem; Visualization

Indexed keywords

EID: 0035612112     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218195901000444     Document Type: Article

References (15)

1. Pankaj K. Agarwal, Marc van Kreveld, and Subhash Suri. Label placement by maximum independent set in rectangles. Computational Geometry: Theory and Applications, 11:209-218, 1998.
2. Bernard Chazelle et al. Application challenges to computational geometry: CG impact task force report. Technical Report TR-521-96, Princeton University, April 1996. http://www.cs.princeton.edu/∼chazelle/taskforce/CGreport.ps.
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. Amitava Datta, Hans-Peter Lenhof, Christian Schwarz, and Michiel H. M. Smid. Static and dynamic algorithms for k-point clustering problems. J. Algorithms, 19:474-503, 1995.
5. 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 (SODA'97), pages 148-157, New Orleans, LA, 4-7 January 1997.
6. Michael Formann and Frank Wagner. A packing problem with applications to lettering of maps. In Proc. 7th Annu. ACM Sympos. Comput. Geom. (SoCG'91), pages 281-288, 1991.
7. 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.
8. Claudia Iturriaga and Anna Lubiw. NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo, Canada, 1997.
9. Konstantinos G. Kakoulis and Ionnis G. Tollis. A unified approach to labeling graphical features. In Proc. 14th Annu. ACM Sympos. Comput. Geom. (SoCG'98), pages 347-356, June 1998.
10. Donald E. Knuth and Arvind Raghunathan. The problem of compatible representatives. SIAM J. Discr. Math., 5(3):422-427, 1992.
11. David Lichtenstein. Planar formulae and their uses. SIAM Journal on Computing, 11(2):329-343, 1982.
12. Joe Marks and Stuart Shieber. The computational complexity of cartographic label placement. Technical Report TR-05-91, Harvard CS, 1991.
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, Alexander Wolff, Vikas Kapoor, and Tycho Strijk. Three rules suffice for good label placement. Algorithmica Special Issue on GIS, 2001. To appear.
15. Alexander Wolff and Tycho Strijk. A map labeling bibliography. http://www. math-inf.uni-greifswald.de/map-labeling/bibliography/, 1996.