Leonidas J. Guibas

Guibas's early work in discrete algorithms included Red-Black trees, a search data structure now taught to undergraduates and part of many C++ or Java libraries. He went on the become one of the founders of the field of Computational Geometry with many accomplishments that define the field today, including algorithms for Voronoi and Delaunay diagrams, the quad-edge data structure, topological sweep, fractional cascading, snap-rounding, and kinetic data structures. These results remain classic, most cited papers in the field. He has contributed in profound ways to an astonishingly diverse set of areas in Computer Science.