Combinatorial and Computational Geometry
János Pach editor Jacob E Goodman editor Emo Welzl editor
Format:Paperback
Publisher:Cambridge University Press
Published:2nd Jun '11
Currently unavailable, and unfortunately no date known when it will be back
This paperback is available in another edition too:
- Hardback£92.00(9780521848626)
This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.
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.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 2005 volume, which contains 32 papers on a broad range of topics of 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. There are points of contact with many applied areas such as mathematical programming, visibility problems, kinetic data structures, and biochemistry, as well as with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.
ISBN: 9780521178396
Dimensions: 234mm x 156mm x 32mm
Weight: 870g
630 pages