DISCRETE AND ALGORITHMIC GEOMETRY

Talks of main speakers (preliminary)


Gil Kalai
: The geometry of the discrete cube. An invitation to Tverberg theorem

Raimund Seidel: Polygonal reconstruction of curves from samples (Parts I and II)

Jack Snoeyink: Compressing the connectivity of polygonal surface meshes Polygon clipping, boolean operations, and overlay in double precision

Emo Welzl: j-facets, k-sets, etc. Randomized Optimization

Gunter M. Ziegler: Reconstructing polytopes from their graphs (Parts I and II)