Abstracts

Amenta Nina, University of Texas at Austin
Computational Geometry and Computer Graphics

Basu Saugata, University of Michigan
On the Connectivity and Topology of Semi-algebraic Sets: Complexity and Algorithms

Bern Marshall, Xerox Parc
Regression Depth and Center Points

Bezdek András, Auburn University
Incidence problems for points and unit circles

Billera Louis J., Cornell University
Enumeration of faces of polytopes: the current state of affairs

Chazelle Bernard, Princeton University
The discrepancy method: geometry, randomness, and complexity

Connelly Robert, Cornell University
Mathematical bellows and volume formulas

De Loera Jesús, University of California-Davis & ETH Zurich
Minimal triangulations and dissections of convex

Demaine Erik, University of Waterloo
Straightening chains and convexifying polygons

Dol'nikov Vladimir L., Yaroslavl State University
Transversals and their applications

Edelsbrunner Herbert, UIUC, Duke and Raindrop
Adaptive meshing for moving boundary problems

Fejes Tóth Gábor, Hungarian Academy of Sciences
Stability of the moment theorem

Füredi Zoltan, University of Illinois
The smallest convex region containing all triangles

Giesen Jochen, ETH Zurich
Curve reconstruction and Traveling Salesman Problem

Hales Thomas C., University of Michigan
The Kepler conjecture

Kalai Gil, Hebrew University of Jerusalem
Variations on the upper bound theorem

Károlyi Gyula, Eotvos University
Ramsey remainder for convex sets and the Erdös-Szekeres Theorem

Katchalski Meir, Technion - Israel Institute of Technology
Common transversals for intersecting planar

Kortenkamp Ulli, ETH Zurich
Cinderella Demo

Lagarias Jeff, AT&T Laboratories
Discrete geometric models for quasicrystals

Matousek Jíri, Charles University
Simultaneous partitions of measures by k-fans

Pach János, New York University
Ramsey-type problems in geometry

Pinchasi Rom, The Hebrew University of Jerusalem
Applications of allowable sequences to plane geometry

Richter-Gebert Jürgen, ETH Zurich
The complex behavior of geometric objects

Sabitov Idjad, Moscow State University
Volume formulas and their applications

Santos Francisco, Universidad de Cantabria
A point set whose space of triangulations is disconnected

Seidel Raimund, Universität des Saarlandes
Lower bounds for geometric computations

Sharir Micha, Tel Aviv University
The union of objects and Voronoi diagrams

Tóth Geza, Massachusetts Institute of Technology
Point sets with many k-sets

Valtr Pavel, Charles University
Turán-type problems for geometric graphs

Wills Jörg M., Universität Siegen
Kepler and the sausage

Ziegler Günter M., Technische Universität Berlin
Coloring of Hamming graphs, and the 0/1-Borsuk problem

Zong Chuanming, Technische Universität Berlin
Blocking light rays

---

Back