Combinatorial and Computational Geometry

by Jacob E. Goodman (Editor), János Pach (Editor), Emo Welzl (Editor)

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.

630 pages, Paperback

First published August 8, 2005

About the author

Jacob Eli Goodman was a geometer and music composer. He was Professor Emeritus at the City College of New York. He and his collaborator, Richard M. Pollack, were known for developing problems in discrete geometry, specifically in the study of arrangements of pseudolines and oriented matroids. He and Pollack were the founding editors of the journal Discrete & Computational Geometry.

Goodman also developed the "pancake problem," which he published under the pseudonym Harry Dweighter. He co-edited the book "Handbook of Discrete and Computational Geometry."