Emo Welzl

Emmerich (Emo) Welzl (born 4 August 1958 in Linz, Austria)[1] is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland.

Biography

Welzl was born on 4 August 1958 in Linz, Austria. He was educated at the Graz University of Technology, where he received a bachelor's degree in 1981 and a doctorate in 1983 under the supervision of Hermann Maurer.[1][2] Following postdoctoral studies at Leiden University, he became a professor at the Free University of Berlin in 1987, and remained there until moving to Zurich in 1996.[1]

Welzl is a member of multiple journal editorial boards, and has been program chair for the Symposium on Computational Geometry in 1995, one of the tracks of the International Colloquium on Automata, Languages and Programming in 2000, and one of the tracks of the European Symposium on Algorithms in 2007.[1]

Research

Much of Welzl's research has been in computational geometry. With David Haussler, he showed that machinery from computational learning theory including ε-nets and VC dimension could be useful in geometric problems such as the development of space-efficient range searching data structures.[3] He devised linear time randomized algorithms for the smallest circle problem[4] and for low-dimensional linear programming, and developed the combinatorial framework of LP-type problems that generalizes both of these problems.[5] Other highly cited research publications by Welzl and his co-authors describe algorithms for constructing visibility graphs and using them to find shortest paths among obstacles in the plane,[6] test whether two point sets can be mapped to each other by a combination of a geometric transformation and a small perturbation,[7] and pioneer the use of space-filling curves for range query data structures.[8]

Awards and honors

Welzl won the Gottfried Wilhelm Leibniz Prize in 1995.[9] He was elected as an ACM Fellow in 1998,[10] as a member of the German Academy of Sciences Leopoldina in 2005,[11] of the Academia Europaea in 2006,[12] and of the Berlin-Brandenburg Academy of Sciences and Humanities in 2007.[13]

References

  1. 1 2 3 4 Curriculum vitae, retrieved 2012-02-11.
  2. ↑ Emmerich (Emo) Welzl at the Mathematics Genealogy Project.
  3. ↑ Haussler, David; Welzl, Emo (1987), "ε-nets and simplex range queries", Discrete and Computational Geometry, 2 (2): 127–151, doi:10.1007/BF02187876, MR 884223.
  4. ↑ Welzl, Emo (1991), "Smallest enclosing disks (balls and ellipsoids)", in Maurer, H., New Results and New Trends in Computer Science, Lecture Notes in Computer Science, 555, Springer-Verlag, pp. 359–370, doi:10.1007/BFb0038202.
  5. ↑ Matoušek, Jiří; Sharir, Micha; Welzl, Emo (1996), "A subexponential bound for linear programming" (PDF), Algorithmica, 16: 498–516, doi:10.1007/BF01940877.
  6. ↑ Welzl, Emo (1985), "Constructing the visibility graph for n line segments in O(n2) time", Information Processing Letters, 20 (4): 167–171, doi:10.1016/0020-0190(85)90044-4, MR 801812.
  7. ↑ Alt, Helmut; Mehlhorn, Kurt; Wagener, Hubert; Welzl, Emo (1988), "Congruence, similarity, and symmetries of geometric objects", Discrete and Computational Geometry, 3 (3): 237–256, doi:10.1007/BF02187910, MR 937285.
  8. ↑ Asano, Tetsuo; Ranjan, Desh; Roos, Thomas; Welzl, Emo; Widmayer, Peter (1997), "Space-filling curves and their use in the design of geometric data structures", Theoretical Computer Science, 181 (1): 3–15, doi:10.1016/S0304-3975(96)00259-9, MR 1463526.
  9. ↑ Leibniz Prize Winners since 1988, Free University of Berlin, retrieved 2012-02-11.
  10. ↑ ACM Fellow award citation, retrieved 2012-02-11.
  11. ↑ Member profile, German Academy of Sciences Leopoldina, retrieved 2012-02-11.
  12. ↑ Member profile, Academia Europaea, retrieved 2012-02-11.
  13. ↑ Member profile, Berlin-Brandenburg Academy of Sciences and Humanities, retrieved 2012-02-11.

External links

This article is issued from Wikipedia - version of the 10/24/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.