May 28, 2010, 1100 Webb

In computer science, we routinely invoke elementary concepts of points, polygons, dimension, distances etc. in modeling of physical objects or their relations. This “geometric lens” has proved to be an intellectually exciting and computationally powerful approach to problem solving in many areas of sciences, engineering, and mathematics. Computational Geometry combines the methodology and framework of classical geometry with the modern notions of computational complexity and algorithmic efficiency. This is intended to be a self-contained introductory talk about Computational Geometry.

Subhash Suri is a Professor of Computer Science at the UCSB. He received his PhD from the Johns Hopkins University in 1987, then worked at the Bell Communications Research (Bellcore) as a member of the Technical Staff until 1994 before moving to the Washington University, St. Louis, as an Associate Professor. He moved to UCSB in 2000. Suri has published nearly 200 research articles in areas spanning Theory of Algorithms, Computational Geometry, Networked Sensing, Robotics, and Game Theory. He serves on the editorial boards of Computational Geometry: Theory and Applications, International Journal of the Foundations of Computer Science, and the ACM Transactions on Sensor Networks, and has served or chaired numerous technical program committees, and National Science Foundation Panels. Suri is a Fellow of the IEEE and an ACM Distinguished Scientist.