Combinatorial and Computational Geometry - Bog

This 2005 volume, covering a broad range of topics, is an outgrowth of the synergism of Discrete and Computational Geometry. Its surveys and research articles explore geometric arrangements, polytopes, packing, covering, discrete convexity, geometric algorithms, and their complexity, and the combinatorial complexity of geometric objects, particularly in low dimension.