Surveys on Discrete and Computational Geometry

This volume contains nineteen survey papers describing the state of current research in discrete and computational geometry as well as a set of open problems presented at the 2006 AMS-IMS-SIAM Summer Research Conference'Discrete and Computational Geometry—Twenty Years Later', held in Snowbird, Utah, in June 2006. Topics surveyed include metric graph theory, lattice polytopes, the combinatorial complexity of unions of geometric objects, line and pseudoline arrangements, algorithmic semialgebraic geometry, persistent homology, unfolding polyhedra, pseudo-triangulations, nonlinear computational geometry, $k$-sets, and the computational complexity of convex bodies. Discrete and computational geometry originated as a discipline in the mid-1980s when mathematicians in the well-established field of discrete geometry and computer scientists in the (then) nascent field of computational geometry began working together on problems of common interest. The combined field has experienced a huge growth in the past twenty years, which the present volume attests to.