Boundary labeling in text annotation

Proceedings of the International Conference on Information Visualisation

Volumn , Issue , 2009, Pages 110-115

  Lin, Chun Cheng ^a   Wu, Hsiang Yun ^b   Yen, Hsu Chun ^b,c  

^a NATIONAL KAOHSIUNG UNIVERSITY OF APPLIED SCIENCES   (Taiwan)

^b NATIONAL TAIWAN UNIVERSITY   (Taiwan)

^c KAINAN UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

ANNOTATION SYSTEMS; BOUNDARY LABELING; NP COMPLETE; POLYNOMIAL-TIME ALGORITHMS; STRAIGHT-LINE SEGMENTS; TEXT ANNOTATIONS; THEORETICAL RESULT; WORD PROCESSOR;

HEURISTIC ALGORITHMS; LABELS; POLYNOMIAL APPROXIMATION;

VISUALIZATION;

EID: 70449491642     PISSN: 10939547     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IV.2009.84     Document Type: Conference Paper

References (15)

1. M. Bekos, M. Kaufmann, K. Potika, and A. Symvonis. Boundary labelling of optimal total leader length. In Proc. of the 10th Panhellenic Conference on Informatics (PCI 2005), volume 3746 of LNCS, pages 80-89, 2005.
2. M. Bekos, M. Kaufmann, K. Potina, and A. Symvonis. Area-feature boundary labeling. The Computer Journal, 2008. To appear.
3. M. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: models and efficient algorithms for rectangular maps. In Proc. of the 12th International Symposium on Graph Drawing (GD 2004), volume 3383 of LNCS, pages 49-59, 2004.
4. M. Bekos, M. Kaufmann, A. Symvonis, and A. Wolff. Boundary labeling: models and efficient algorithms for rectangular maps. Computational Geometry: Theory and Applications, 36(3):215-236, 2006.
5. M. Benkert, H. Haverkort, M. Kroll, and M. Nöllenburg. Algorithms for multi-criteria one-sided boundary labeling. In Proc. of the 15th International Symposium on Graph Drawing (GD 2007), volume 4875 of LNCS, pages 243-254, 2008.
6. B. Chazelle and 36 co-authors. The computational geometry impact task force report. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223, pages 407-463. AMS, 1999.
7. M. Formann and F. Wagner. A packing problem with applications to lettering of maps. In Proc. of the 7th Annual ACM Symposium on Computational Geometry (SoCG 1991), pages 281-288. ACM Press, 1991.
8. J. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
9. E. Imhof. Positioning names on maps. The American Cartographer, 2(2):128-144, 1975.
10. C. Iturriaga and A. Lubiw. NP-hardness of some map labeling problems. Technical Report CS-97-18, University of Waterloo, 1997.
11. C.-C. Lin, K.-R. Kao, and H.-C. Yen. Many-to-one boundary labeling. Journal of Graph Algorithms and Applications, 12(3):319-356, 2008.
12. G. Neyer. Map labeling with application to graph drawing. In D.Wagner and M. Kaufman, editors, Drawing graphs: Methods and models, volume 2025 of LNCS, pages 247-273. 2001.
13. F. Wagner. Approximate map labeling is in ω(nlogn). Information Processing Letter, 52(3):161-165, 1994.
14. F. Wagner and A. Wolff. Map labeling heuristics: Provably good and practically useful. In Proc. of the 11th Annual ACM Symposium on Computational Geometry (SoCG 1995), pages 109-118. ACM Press, 1995.
15. A. Wolff and T. Strijk. The map-labeling bibliography. http://i11www.ira.uka.de/map-labeling/bibliography/, 1996.