Area-feature boundary labeling

Computer Journal

Volumn 53, Issue 6, 2010, Pages 827-841

  Bekos, Michael A ^a   Kaufmann, Michael ^b   Potika, Katerina ^a   Symvonis, Antonios ^a  

^a NATIONAL TECHNICAL UNIVERSITY OF ATHENS   (Greece)

^b UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

Boundary labeling; Design and analysis of algorithms; Map labeling

Indexed keywords

BOUNDARY LABELING; DESIGN AND ANALYSIS OF ALGORITHMS; LABELING METHODS; MAP-LABELING; POLYGONAL REGIONS; POLYNOMIAL-TIME ALGORITHMS; PRODUCTION OF; TECHNICAL DRAWING;

COMPUTER SCIENCE;

POLYNOMIAL APPROXIMATION;

EID: 84856462358     PISSN: 00104620     EISSN: 14602067     Source Type: Journal    
DOI: 10.1093/comjnl/bxp087     Document Type: Article

References (15)

1. Bekos, M.A., Kaufmann, M., Potika, K. and Symvonis, A. (2006) Polygons Labelling of Minimum Leader Length. In Kazuo, M., Kozo, S. and Jiro, T. (eds.), Proc. 5th Asia Pacific Symp. Information Visualisation (APVIS2006), Tokyo, Japan, February 1-3, CRPIT, Vol. 60, pp. 15-21. Australian Computer Society. ISBN: 1-920682-41-4.
2. Formann, M. and Wagner, F. (1991) A Packing Problem with Applications to Lettering of Maps. Proc. 7th Annual ACM Symp. Computational Geometry, North Conway, NH, USA, pp. 281-288.
3. Wolff, A. and Strijk, T. The map-labeling bibliography. http://i11www.ira.uka.de/map-labeling/bibliography.
4. Bekos, M.A., Kaufmann, M., Symvonis, A., and Wolff, A. (2007) Boundary labeling: models and efficient algorithms for rectangular maps. Computational Geom., Theory Appl, 36, 215-236.
5. Vaidya, P.M. (1989) Geometry helps in matching. SIAM J. Comput., 18, 1201-1225.
6. Bekos, M.A., Kaufmann, M., Potika, K. and Symvonis, A. (2006) Multi-stack Boundary Labeling Problems. In Arun-Kumar, S. and Garg, N. (eds.), Proc. 26th Conf. Foundations of Software Technology and Theoretical Computer Science (FSTTCS2006), Kolkata, India, December 13-15, Lecture Notes in Computer Science 4337, pp. 81-92. Springer.
7. Bekos, M.A., Kaufmann, M. and Symvonis, A. (2007) Labeling Collinear Sites. In Hong, S.-H. and Ma, K.-L. (eds.), Proc. 6th Int. Asia-Pacific Symp. Visualization (APVIS2007), Sydney, Australia, February 5-7, pp. 45-51. IEEE.
8. Benkert, M. and Nöllenburg, M. (2007) Improved Algorithms for Length-Minimal One-Sided Boundary Labeling. Proc. 23rd European Workshop on Computational Geometry (EWCG'07), Graz, Austria, March 19-21, pp. 190-193.
9. Benkert, M., Haverkort, H., Kroll, M. and Nöllenburg, M. (2007) Algorithms for Multi-criteria One-Sided Boundary Labeling. In Hong, S.-H., Nishizeki, T. and Quan, W. (eds.), Proc. 15th Int. Symp. Graph Drawing (GD'07), Sydney, Australia, September 24-26, Lecture Notes in Computer Science 4875, pp. 243-254. Springer.
10. Bekos, M.A., Kaufmann, M., Nöllenburg, M. and Symvonis, A. (2008) Boundary Labeling with Octilinear Leaders. In Gud-mundsson, J. (ed.), Proc. 11th Scandinavian Workshop on Algorithm Theory (SWAT08), Gothenburg, Sweden, July 2-4, Lecture Notes in Computer Science 5124, pp. 234-245. Springer.
11. Kao, H.-J., Lin, C.-C. and Yen, H.-C. (2007) Many-to-One Boundary Labeling. In Hong, S.-H. and Ma, K.-L. (eds.), Proc. 6th Int. Asia-Pacific Symp. Visualization (APVIS2007), Sydney, Australia, February 5-7, pp. 65-72. IEEE.
12. deBerg, M., van Kreveld, M., Overmars, M.and Schwarzkopf, O. (2000) Computational Geometry: Algorithms and Applications, (2nd edn). Springer.
13. Lee, D.T. (1980) Two-dimensional Voronoi diagrams in the LP-metric. J. Assoc. Comput. Mach., 27, 604-618.
14. Kuhn, H.W. (1955) The Hungarian method for the assignment problem. Nav. Res. Logist. Q., 2, 83-97.
15. Mehlhorn, K. (1984) Data Structures and Algorithms 3: Multidimensional Searching and Computational Geometry. Springer.