From
California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since October 27, 2023
Seller Inventory # I-9780521178396
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.
Title: Combinatorial and Computational Geometry (...
Publisher: Cambridge University Press
Publication Date: 2011
Binding: Soft cover
Condition: New
Seller: Prior Books Ltd, Cheltenham, United Kingdom
Paperback. Condition: Like New. First Edition. A firm and square hardback with strong joints, just showing a few mild rubs and a couple of very minor bumps, and so a non-text page is stamped 'damaged'. Despite such this book is actually in nearly new condition, thus contents are fresh, crisp and tight. A very decent unread copy in great shape now offered for sale at a special bargain price. Seller Inventory # 115911
Quantity: 1 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Feb2215580246442
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9780521178396
Quantity: 10 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9780521178396_new
Quantity: Over 20 available
Seller: Revaluation Books, Exeter, United Kingdom
Paperback. Condition: Brand New. 1st edition. 628 pages. 9.21x6.14x1.26 inches. In Stock. This item is printed on demand. Seller Inventory # __0521178398
Quantity: 1 available
Seller: moluna, Greven, Germany
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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 algori. Seller Inventory # 446928928
Quantity: Over 20 available
Seller: CitiRetail, Stevenage, United Kingdom
Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521178396
Quantity: 1 available
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.
Paperback. Condition: new. Paperback. 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. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. Seller Inventory # 9780521178396
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Combinatorial and Computational Geometry | Jacob E. Goodman (u. a.) | Taschenbuch | Kartoniert / Broschiert | Englisch | 2011 | Cambridge University Press | EAN 9780521178396 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Seller Inventory # 107466722
Quantity: 5 available
Seller: AussieBookSeller, Truganina, VIC, Australia
Paperback. Condition: new. Paperback. 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. 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521178396
Quantity: 1 available