ShopSpell

Combinatorial and Computational Geometry [Hardcover]

$123.99       (Free Shipping)
92 available
  • Category: Books (Computers)
  • ISBN-10:  0521848628
  • ISBN-10:  0521848628
  • ISBN-13:  9780521848626
  • ISBN-13:  9780521848626
  • Publisher:  Cambridge University Press
  • Publisher:  Cambridge University Press
  • Pages:  630
  • Pages:  630
  • Binding:  Hardcover
  • Binding:  Hardcover
  • Pub Date:  01-May-2005
  • Pub Date:  01-May-2005
  • SKU:  0521848628-11-MPOD
  • SKU:  0521848628-11-MPOD
  • Item ID: 100741640
  • Seller: ShopSpell
  • Ships in: 2 business days
  • Transit time: Up to 5 business days
  • Delivery by: Jan 19 to Jan 21
  • Notes: Brand New Book. Order Now.
This 2005 book deals with interest topics in Discrete and Algorithmic aspects of Geometry.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.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.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 geometrilÓR
Add Review