Combinatorial and Computational Geometry

Discover the fascinating world of geometry with Combinatorial and Computational Geometry by Jacob E. Goodman, published by Cambridge University Press in 2011. This comprehensive volume spans 630 pages and delves into a wide array of topics that bridge the realms of Discrete and Computational Geometry.

This book features insightful surveys and cutting-edge research articles that examine geometric arrangements, polytopes, packing, covering, and discrete convexity. It also addresses geometric algorithms and their complexities, alongside the combinatorial intricacies of geometric objects, particularly in low dimensions.

Whether you are a student, researcher, or enthusiast, this work is an essential addition to your library, offering valuable perspectives on data processing and the complexities of geometry. Enhance your understanding and appreciation of these critical mathematical concepts with Goodman's expert insights.