stanford.seal64.gif (1,768 bytes)

Broad Area Colloquium for Artificial Intelligence,
Geometry, Graphics, Robotics and Vision

Digital Geometry Processing

Peter Schröder

Monday, November 12, 2001, 4:15PM
Gates B01


The goal of Digital Geometry Processing research is the construction of mathematics and algorithms to make digital proxies of geometry as easy and efficient to manipulate as earlier generations of digital multimedia (sound, image, video). Since surfaces carry intrinsic curvature, straightforward application of digital signal processing algorithms to geometry is not possible. Hence the need for a new apparatus.

Mathematical tools and algorithms from the construction of surfaces through repeated refinement, so called Subdivision surfaces, have proven to be extraordinarily useful in building Digital Geometry Processing tools. After a brief introduction to subdivision, I will discuss several Digital Geometry Processing algorithms ranging from applications in engineering design to entertainment. The focus will be on the common underlying mathematical ideas such as multiresolution, for example.

About the Speaker

Peter Schröder is a professor of computer science and applied & computational mathematics at Caltech. He received his MS from MIT's Media Lab and a PhD from Princeton University. His research has focussed on numerical algorithms in computer graphics applications and in particular the use of wavelet and more general hierarchical techniques for the construction of asymptotically optimal algorithms. Most recently he has worked on efficient representations and algorithms for surfaces. His work is recognized widely. He is a Packard Foundation Fellow and recently received a Discover Magazine Finalist award for his work on surface compression.


Back to the Colloquium Page