Algorithms for boundary labeling

An overview on recent work on map labeling will be presented with emphasis on labeling with leaders. The labels are assumed to be placed on the boundary of the map while they are connected to the corresponding graphical features by polygonal lines, the so-called leaders.

发言人详细信息

Michael Kaufmann is a professor of University of Tubingen. His research interests are in Algorithms and Complexity, Approximations, Combinatorial Optimization, Computational Geometry, Graph Drawing and applications, I/O algorithms and Parallelism.Here is the list of Michael’s academic activities:2000-2005: Director Steinbeis Center ‘Efficient algorithms and visualization of discrete structures’Since 1996: Member of the Editorial Board of the Journal of Graph Algorithms and ApplicationsSince 2001: Member of the Editorial Board of the Journal of Discrete Algorithms2001: Co-founder of the Spin-off yWorks GmbH, Tubingen2006: Co-Chair of the 14. Symposium on Graph DrawingSince 2004: Member of the Steering Committee of Workshop on Graph-Theoretic Concepts in Computer Science (WG)2006 -2008: Member of the Steering Committee of Symposium on Graph Drawing

日期：
演讲者：
Michael Kaufmann
所属机构：
University of Tubingen