Combinatorial and Computational Geometry

Jacob E. Goodman

ISBN 10: 0521178398 / ISBN 13: 9780521178396

Published by Cambridge University Press, 2011

About this Item

Druck auf Anfrage Neuware - Printed after ordering - 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.

Seller Inventory # 9780521178396

Bibliographic Details

• Title: Combinatorial and Computational Geometry
• Publisher: Cambridge University Press
• Publication Date: 2011
• Language: English
• ISBN 10: 0521178398
• ISBN 13: 9780521178396
• Binding: Taschenbuch
• Condition: Neu
• Dimensions: 234W x 156H x 34D millimeters 234 millimeters width by 156 millimeters height by 34 millimeters depth
• Weight: 942 grams

About this title

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 Description

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.