Algorithms and data structures Guibas's early work contributed several widely used data structures and algorithms in
computational geometry. With
Robert Sedgewick, he introduced
red–black trees, a form of self-balancing binary search tree. Other contributions from this period include
finger trees,
fractional cascading, an optimal data structure for
point location, the
quad-edge data structure for representing planar subdivisions, and the Guibas–
Stolfi algorithm for
Delaunay triangulation. He also developed
kinetic data structures for tracking objects in motion.
Computer graphics and vision In computer graphics, Guibas co-authored work on
Metropolis light transport, which enabled practical
global illumination algorithms for photorealistic rendering. The EMD paper received the ICCV Helmholtz Prize in 2013, recognizing work with fundamental impact on computer vision.
Deep learning on point clouds and 3D geometry More recently, Guibas's group has been a leader in applying deep learning to irregular geometric data such as
point clouds and
voxels. With Charles R. Qi, Hao Su, and others, he co-developed
PointNet (2017), a neural network architecture that directly consumes raw point clouds for tasks including 3D object classification, part segmentation, and scene semantic parsing, without requiring conversion to voxel grids or image projections. The follow-up PointNet++ introduced hierarchical feature learning that captures local geometric structure at multiple scales. These architectures have been applied to problems in
autonomous driving,
robotics, and
computational fluid dynamics. His group has also developed methods for functional maps between shapes, 3D object detection in point clouds, shape generation, and deformation-aware 3D model analysis. == Awards and honors ==