Combinatorial and Computational Geometry (Hardcover)

Goodman, Jacob E.

ISBN 10: 0521848628 / ISBN 13: 9780521848626

Published by Cambridge University Press, Cambridge, 2005

About this Item

Hardcover. 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 volume, which contains 32 papers on a broad range of topics of current 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. This 2005 book deals with current interest topics in Discrete and Algorithmic aspects of Geometry. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.

Seller Inventory # 9780521848626

Bibliographic Details

• Title: Combinatorial and Computational Geometry (Hardcover)
• Publisher: Cambridge University Press, Cambridge
• Publication Date: 2005
• Language: English
• ISBN 10: 0521848628
• ISBN 13: 9780521848626
• Binding: Hardcover
• Condition: new

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 volume, which contains 32 papers on a broad range of topics of current 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.

Book Description

This volume, containing 32 papers on a broad range of topics of current interest in the field, is an outgrowth of the synergism of Discrete and Computational Geometry. 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, and with algebraic topology, geometric probability, real algebraic geometry, and combinatorics.