Combinatorial and Computational Geometry

Discover the fascinating world of geometry with Combinatorial and Computational Geometry, authored by experts in the field and published by Cambridge University Press in 2005. This comprehensive hardback edition spans 630 pages and serves as a pivotal resource for understanding the intricate relationship between Discrete and Computational Geometry.

Delve into a variety of engaging topics, including geometric arrangements, polytopes, packing, covering, and discrete convexity. The book features insightful surveys and groundbreaking research articles that examine geometric algorithms and their complexities. Additionally, it highlights the combinatorial complexity of geometric objects, particularly in low-dimensional spaces.

Whether you are a student, researcher, or enthusiast, this volume is an essential addition to your library, offering a rich perspective on contemporary geometric theories and applications.