You might also like

More about Combinatorial and Computational Geometry

• Book details
• Synopsis
• Trending among others

You get 183 loyalty points

Book synopsis

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.

Book details

Book category Books in English Mathematics & science Mathematics Geometry

• Full title: Combinatorial and Computational Geometry
• Author: Jacob E. GoodmanJanos PachEmo Welzl
• Language: English
• Binding: Paperback
• Number of pages: 630
• EAN: 9780521178396
• ISBN: 0521178398
• ID: 02024799
• Publisher: Cambridge University Press
• Weight: 870 g
• Dimensions: 234 × 156 × 32 mm
• Date of publishing: 02. June 2011

Trending among others

---

---

---