This workshop is intended to introduce the area of discrete and computational geometry to mathematicians and computer scientists not (yet) active in the field, or just entering it, and is aimed particularly at graduate students and postdocs and at researchers who may already be working in other but related areas. It will highlight the interaction between mathematical and algorithmic aspects of the field.

The speakers, each of whom will give a pair of one-hour talks, are all leading researchers in the field and have been chosen especially for their accessible styles. They are as follows:

*Bernd Sturmfels: Tropical Geometry
*Joel Hass: Minimal Surfaces and Normal Surfaces in 3-Manifolds
*Jeff Lagarias: Quasicrystals and Discrete Geometry; Density of Sphere Packings
*Erik Demaine: Folding & Unfolding: Linkage Folding; Computational Origami
*Ron Graham: Euclidean Ramsey Theory; Packing Equal Discs in Planar Regions
*Guenter M. Ziegler: 4-Dimensional Polytopes
*Joe O'Rourke: Folding & Unfolding: Folding Polygons to Convex Polyhedra; Unfolding Polyhedra
*Emo Welzl: Combinatorial Models for Solving Linear Programs; k-Sets and j-Facets
*Gil Kalai: Graphs and Skeleta of Polytopes
*David Eppstein: Computational Geometry and Robust Statistics; Hyperbolic Geometry, Moebius Transformations, and Geometric Optimization
*Richard Gardner: Discrete Tomography: a Survey; Reconstruction of Convex Bodies from Brightness Functions
*Imre Barany: Combinatorial Convexity: Theorems of Caratheodory, Helly, Radon and Tverberg; Algebraic Topology Applied in Geometry
*Robin Forman: Topics in Combinatorial Differential Geometry
*Nina Amenta: Finding Objects in the Delaunay Triangulation; Actually Doing It: Algorithms and Programs for 3D Delaunay Triangulation
*Janos Pach: Geometric Graph Theory
*Alexander Barvinok: Complexity of Convex Bodies in Higher Dimensions

Funding

Important