|
|
pop@ams.org |
Discrete and Computational Geometry--Twenty Years Later Sunday, June 18 – Thursday, June 22 Organizing Committee Discrete and Computational Geometry arose as a new field within the past twenty-five years, through an amalgamation of the old field of discrete geometry and the nascent field of computational geometry. It is now a very active area of research, on the interface between pure mathematics and theoretical computer science, which is devoted to understanding the structure and complexity of discrete geometric structures as well as the design and analysis of geometric algorithms for the manipulation of these structures. Key examples of the objects studied or manipulated are arrangements (of lines and curves and their higher-dimensional analogues), polytopes and polyhedra, tilings, packings and coverings, oriented matroids, simplicial complexes, geometric graphs, spaces of transversals to families of convex sets, Voronoi diagrams, etc. Discrete and Computational Geometry bears strong relations to other mathematical areas such as algebra (toric varieties, symmetry groups, real algebraic geometry), topology (combinatorial manifolds, realization spaces), probability theory (randomization techniques, geometric probability), and combinatorics (extremal graph and hypergraph theory). At the same time there are numerous applications to such areas as mathematical programming, geographic information systems, solid modeling, crystallography, and computational biology. The conference, which is the third decennial Summer Research Conference in this field, and which, at the same time, coincides with the twentieth anniversary of the founding of the journal Discrete & Computational Geometry, will bring together people in all of these areas. In particular, we hope to focus on several topics in which there has been a good deal of activity recently, including extremal and reconstruction problems on polytopes, real-algebraic techniques and problems, rigidity theory, toric varieties, Erdős-type problems involving incidences between points and curves and distances in point sets, relations with enumerative combinatorics, sphere packing, geometric transversal theory, geometric discrepancy, and geometric graph theory. Invited speakers (all are confirmed): Pankaj K. Agarwal, Duke; Imre Bárány, Rényi Inst., Hungarian Acad. of Sciences; Alexander Barvinok, Michigan; Saugata Basu, Georgia Tech; Louis J. Billera, Cornell; Xiaomin Chen, Rutgers; Robert Connelly, Cornell; Erik Demaine, MIT; Herbert Edelsbrunner, Duke; Jacob Fox, MIT; Zoltán Füredi, Illinois; Tobias Gerken, Tech. Univ. München; Thomas C. Hales, Pittsburgh; Andreas Holmsen, Bergen; Jeff Lagarias, Michigan; Joseph O'Rourke, Smith; Francisco Santos, Cantabria; Micha Sharir, Tel Aviv University; József Solymosi, UBC; Frank Sottile, Texas A & M; Daniel Štefankovič, Chicago; Ileana Streinu, Smith; Emo Welzl, ETH Zürich; Günter M. Ziegler, Tech. Univ. Berlin. |
||||
|
|
|||||
