Leonidas John Guibas ( el, Λεωνίδας Γκίμπας) is the Paul Pigott Professor of Computer Science and Electrical Engineering at
Stanford University. He heads the Geometric Computation group in the Computer Science Department.
Guibas obtained his Ph.D. from
Stanford University in 1976. That same year, he was program chair for the
ACM Symposium on Computational Geometry The International Symposium on Computational Geometry (SoCG) is an academic conference in computational geometry. It was founded in 1985, and was originally sponsored by the SIGACT and SIGGRAPH Special Interest Groups of the Association for Computi ...
in 1996. In 2017 he was elected to the
National Academy of Engineering
The National Academy of Engineering (NAE) is an American nonprofit, non-governmental organization. The National Academy of Engineering is part of the National Academies of Sciences, Engineering, and Medicine, along with the National Academy of ...
. Guibas is a
Fellow
A fellow is a concept whose exact meaning depends on context.
In learned or professional societies, it refers to a privileged member who is specially elected in recognition of their work and achievements.
Within the context of higher education ...
of the ACM and the
IEEE
The Institute of Electrical and Electronics Engineers (IEEE) is a 501(c)(3) professional association for electronic engineering and electrical engineering (and associated disciplines) with its corporate office in New York City and its operat ...
, and was awarded the
ACM - AAAI Allen Newell Award for 2007 "for his pioneering contributions in applying algorithms to a wide range of computer science disciplines." In 2018 he was elected to the
American Academy of Arts and Sciences
The American Academy of Arts and Sciences (abbreviation: AAA&S) is one of the oldest learned societies in the United States. It was founded in 1780 during the American Revolution by John Adams, John Hancock, James Bowdoin, Andrew Oliver, a ...
. In 2022 he was elected to the
National Academy of Sciences.
Research
The research contributions Guibas is known for include
finger trees,
red–black trees,
fractional cascading In computer science, fractional cascading is a technique to speed up a sequence of binary searches for the same value in a sequence of related data structures. The first binary search in the sequence takes a logarithmic amount of time, as is standar ...
, the Guibas–
Stolfi algorithm for
Delaunay triangulation
In mathematics and computational geometry, a Delaunay triangulation (also known as a Delone triangulation) for a given set P of discrete points in a general position is a triangulation DT(P) such that no point in P is inside the circumcircle o ...
, an optimal data structure for
point location
The point location problem is a fundamental topic of computational geometry. It finds applications in areas that deal with processing geometrical data: computer graphics, geographic information systems (GIS), motion planning, and computer aided d ...
, the
quad-edge data structure for representing planar subdivisions,
Metropolis light transport
Metropolis light transport (MLT) is a global illumination application of a variant of the Monte Carlo method called the Metropolis–Hastings algorithm to the rendering equation for generating images from detailed physical descriptions of three- ...
, and
kinetic data structure
A kinetic data structure is a data structure used to track an attribute of a geometric system that is moving continuously.
For example, a kinetic convex hull data structure maintains the convex hull of a group of n moving points. The developme ...
s for keeping track of objects in motion. More recently, he has focused on shape analysis and computer vision using deep neural networks. He has
Erdős number
The Erdős number () describes the "collaborative distance" between mathematician Paul Erdős and another person, as measured by authorship of mathematical papers. The same principle has been applied in other fields where a particular individual ...
2 due to his collaborations with Boris Aronov,
Andrew Odlyzko
Andrew Michael Odlyzko (Andrzej Odłyżko) (born 23 July 1949) is a Polish-American mathematician and a former head of the University of Minnesota's Digital Technology Center and of the Minnesota Supercomputing Institute. He began his career in ...
,
János Pach
János Pach (born May 3, 1954) is a mathematician and computer scientist working in the fields of combinatorics and discrete and computational geometry.
Biography
Pach was born and grew up in Hungary. He comes from a noted academic family: his ...
, Richard M. Pollack,
Endre Szemerédi
Endre Szemerédi (; born August 21, 1940) is a Hungarian-American mathematician and computer scientist, working in the field of combinatorics and theoretical computer science. He has been the State of New Jersey Professor of computer science ...
, and
Frances Yao.
Erdős number project
References
External links
Guibas laboratory
Detection of Symmetries and Repeated Patterns in 3D Point Cloud Data
videolecture by Guibas
*
*
{{DEFAULTSORT:Guibas, Leonidas J.
Year of birth missing (living people)
Living people
Stanford University alumni
Stanford University School of Engineering faculty
Stanford University Department of Computer Science faculty
Researchers in geometric algorithms
Greek computer scientists
American computer scientists
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE
Members of the United States National Academy of Engineering
Members of the United States National Academy of Sciences