#52:
Combinatorial and Computational Geometry
**Up:** MSRI Publications

# MSRI Publications – Volume 52

## Combinatorial and Computational Geometry

### Edited by
Jacob E. Goodman,
János Pach and
Emo Welzl

During the past few decades, the gradual merger of Discrete Geometry
and the newer discipline of Computational Geometry has provided
enormous impetus to mathematicians and computer scientists interested
in geometric problems. This volume, which contains 32 papers on a
broad range of topics of current interest in the field, is an
outgrowth of that synergism. It includes surveys and research articles
exploring geometric arrangements, polytopes, packing, covering,
discrete convexity, geometric algorithms and their complexity, and the
combinatorial complexity of geometric objects, particularly in low
dimension. There are points of contact with many applied areas such as
mathematical programming, visibility problems, kinetic data
structures, and biochemistry, as well as with algebraic topology,
geometric probability, real algebraic geometry, and combinatorics.