Leonidas J. Guibas
Professor, Computer Science and
Electical Engineering (courtesy)
|
 
Professor
Guibas heads the Geometric Computation group in the Computer Science
Department of Stanford University and is a member of the Computer
Graphics and Artificial Intelligence Laboratories. He works on algorithms
for sensing, modeling, reasoning, rendering, and acting on the physical
world. Professor Guibas' interests span computational geometry,
geometric modeling, computer graphics, computer vision, sensor networks,
robotics, and discrete algorithms --- all areas in which he has
published and lectured extensively. Examples of current and recent
activities include:
|
| data structures for mobile data (kinetic data structures) |
| ad-hoc sensor and communication networks |
| randomized geometric algorithms |
| rounding and approximating geometric structures |
| local
and global analysis with point cloud data |
| Monte-Carlo algorithms for global illumination and motion planning |
| organizing and searching libraries of 3D shapes and images |
| physical
simulations involving deformations and contacts |
|
Leonidas
Guibas obtained his Ph.D. from Stanford in 1976, under the supervision
of Donald Knuth. His main subsequent employers were Xerox PARC, MIT,
and DEC/SRC. He has been at Stanford since 1984 as Professor of Computer
Science. He has produced several Ph.D. students who are well-known
in computational geometry, such as John Hershberger, Jack Snoeyink,
and Jorge Stolfi, or in computer graphics, such as David Salesin and
Eric Veach. At Stanford he has developed new courses in algorithms
and data structures, geometric modeling, geometric algorithms, and
sensor networks. Professor Guibas is an ACM Fellow and winner of the ACM/AAAI Allen Newell award. |
|
|
