Combinatorial Computational Geometry (31 results)

hardcover. Condition: Good. volume 52 No dust jacket. Good hardcover with some shelfwear; may have previous owner's name inside. Standard-sized.

Hardcover. Condition: Very Good+. Text clean and tight; no dust jacket; Mathematical Sciences Research Institute Publications 52; 1.6 x 9.2 x 6.4 Inches; 628 pages.

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.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 05 GOO 9780521848626 Sprache: Englisch Gewicht in Gramm: 1100.

Condition: New.

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.

Condition: New. In.

PF. Condition: New.

Condition: New.

Condition: New.

Hardcover. Condition: new. 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 multiple locations in the US or from the UK, depending on stock availability.

Condition: New. In.

Condition: New. 2025. paperback. . . . . .

Hardcover. Condition: Like New. Like New. book.

Condition: New. 2025. paperback. . . . . . Books ship from the US and Ireland.

Condition: New. pp. 630.

Taschenbuch. Condition: Neu. 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.

Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - This 2005 book deals with current interest topics in Discrete and Algorithmic aspects of Geometry.

Paperback. Condition: Brand New. 1st edition. 628 pages. 9.21x6.14x1.26 inches. In Stock. This item is printed on demand.

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.

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.

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.

Hardcover. Condition: Brand New. new title edition. 628 pages. 9.75x6.50x1.50 inches. In Stock. This item is printed on demand.

Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

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.

Hardcover. Condition: new. 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Gebunden. 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.

Condition: New. Print on Demand pp. 630 Illus.

Condition: New. PRINT ON DEMAND pp. 630.

Hardcover. Condition: new. 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. 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.