Leonidas J. Guibas

Stanford Univ., Computer Science Dept.
http://robotics.stanford.edu/users/guibas/bio.html
guibas@cs.stanford.edu

Author, editor, or reviewer of:

• A simple and efficient procedure for polyhedral assembly partitioning under infinitesimal motions
• Algorithms for weak epsilon-nets
• Cylindrical static and kinetic binary space partitions
• Deformable free space tilings for kinetic collision detection
• Deformable spanners and applications
• Geometric spanner for routing in mobile networks
• Kinetic collision detection between simple polygons
• Maintaining the extent of a geometric point set
• On incremental rendering of silhouette maps of a polyhedral scene
• Parametric and kinetic minimum spanning trees
• Polyhedral assembly partitioning using maximally covered cells in arrangements of convex polytopes
• Selecting heavily covered points
• Sensing, tracking, and reasoning with relations
• Static and kinetic geometric spanners with applications
• Staying in the middle: exact and approximate medians in $R^1$ and $R^2$ for moving points
• The centroid of points with approximate weights
• The robot localization problem