Combinatorial and Computational Geometry

Jacob E. Goodman, Janos Pach, Emo Welzl
Cambridge University Press, 2. jun. 2011 - 630 sider
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.

Hvad folk siger - Skriv en anmeldelse

Vi har ikke fundet nogen anmeldelser de normale steder.

Andre udgaver - Se alle

Bibliografiske oplysninger