Leonidas J. Guibas

from Wikipedia, the free encyclopedia
Leonidas J. Guibas (2010)

Leonidas J. Guibas (* 1949 ) is an American computer scientist .

Leonidas Guibas received his doctorate in 1976 from Donald E. Knuth at Stanford University . He then worked at Xerox PARC , the Massachusetts Institute of Technology, and the DEC Systems Research Center. In 1984 he became a professor at Stanford University.

He is particularly concerned with algorithmic geometry (computational geometry) and computer graphics with applications for example on sensor networks and communication networks, robotics, VLSI design, algorithmic molecular biology. He and E. Veach created the ray tracing process, Bidirectional Path Tracing, and its extension, Metropolis Light Transport (MLT).

In 2007 he received the ACM-AAAI Allen Newell Award for pioneering work in algorithmic geometry with applications to an astonishingly wide range of computer science disciplines (laudatory speech). He is a Fellow of the Association for Computing Machinery and an IEEE Fellow . He became a Fellow of the ACM for his work on geometric data structures, arrangements of surfaces and their applications, geometric algorithms in computer graphics and algorithmic aspects of computer vision (laudation 1999).

In 2018 Guibas was elected to the American Academy of Arts and Sciences .

Fonts (selection)

  • with Robert Sedgewick : A dichromatic framework for balanced trees, 19th Annual Symposium on Foundations of Computer Science, 1978, pp. 8-21 ( Rot-Schwarz-Baum )
  • with J. Stolfi: Primitives for the manipulation of general subdivisions and the computation of Voronoi, ACM transactions on graphics (TOG), Volume 4, 1985, pp. 74-123
  • with J. Hershberger, D. Leven, M. Sharir, RE Tarjan: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons, Algorithmica, Volume 2, 1987, pp. 209-233
  • with DE Knuth, M. Sharir: Randomized incremental construction of Delaunay and Voronoi diagrams, Algorithmica, Volume 7, 1992, pp. 381-413
  • with E. Veach: Metropolis light transport, Proceedings of the 24th annual conference on Computer graphics and interactive techniques, 1997
  • with Y. Rubner, C. Tomasi: A metric for distributions with applications to image databases, Sixth International Conference on Computer Vision, 1998, pp. 59-66
  • with Y. Rubner, C. Tomasi: The earth mover's distance as a metric for image retrieval, International journal of computer vision, Volume 40, 2000, pp. 99-121
  • with F. Zaho, J. Liu, J. Reich: Collaborative signal and information processing: an information-directed approach, Proceedings of the IEEE, Volume 91, 2003, pp. 1199-1209
  • with Feng Zhao: Wireless sensor networks: an information processing approach, Morgan Kaufmann 2004
  • with N. Gelfand, NJ Mitra, H. Pottmann: Robust global registration, Symposium on geometry processing, Volume 2, 2005, p. 5
  • with Q. Fang, J. Gao: Locating and bypassing holes in sensor networks, Mobile networks and Applications, Volume 11, 2006, pp. 187-200
  • with J. Sun, M. Ovsjanikov: A concise and provably informative multi scale signature based on heat diffusion, Computer graphics forum, Volume 28, 2009, pp. 1383-1392

Web links

Individual evidence

  1. ↑ Leonidas J. Guibas in the Mathematics Genealogy Project (English)Template: MathGenealogyProject / Maintenance / id used
  2. ^ Newell Award for Guibas
  3. ↑ Book of Members 1780 – present, Chapter G. (PDF; 931 kB) In: American Academy of Arts and Sciences (amacad.org). Accessed October 7, 2018 (English).
personal data
SURNAME Guibas, Leonidas J.
BRIEF DESCRIPTION American computer scientist
DATE OF BIRTH 1949