Monday, November 3

Computational Geometry and Topology

10:30 AM-12:30 PM
Room: Cheekwood

The traditional view of computational geometry is that it studies algorithms for discrete geometric problems such as computing the convex hull of a set of points. The emphasis is on combinatorial methods and algorithms with fast asymptotic running time. A more recent development is the study of discrete topological problems motivated by questions of connectivity and continuity, a development that complements traditionally strong numerical research.

This minisymposium offers an introduction to the wide spectrum of research in computational geometry and topology. The speakers will present leading edge research in geometric algorithm design and demonstrate the continuity between geometry and topology.

Organizer: Herbert Edelsbrunner
University of Illinois, Urbana-Champaign

10:30 Kinetic Data Structures
Leonidas J. Guibas, Stanford University
11:00 Maintaining Delaunay Complexes under Motion in R3
Michael A. Facello, Raindrop Geomagic Inc., Urbana, IL
11:30 Minimization of Mathematical Energies for Surfaces
John Sullivan, University of Minnesota, Minneapolis
12:00 Computing Homology Groups of Simplicial Complexes
Sumanta Guha, University of Wisconsin, Milwaukee

GD97 Homepage | Program Updates| Registration | Hotel Information | Transportation |
Program-at-a-Glance | Program Overview | Speaker Index |

MMD, 7/9/97