Order Total (1 Item Items):
Shipping Destination:
Algorithms Combinatorial Geometry by Edelsbrunner Herbert (35 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (35)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (25)
- As New, Fine or Near Fine (7)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (18)
- Not Print on Demand (23)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Algorithms in Combinatorial Geometry. Monographs in Theoretical Computer Science. An EATCS Series, Band 10.
Seller: books4less (Versandantiquariat Petra Gros GmbH & Co. KG), Welling, Germany
Seller rating 5 out of 5 stars
gebundene Ausgabe. Condition: Gut. 423 Seiten Der Erhaltungszustand des hier angebotenen Werks ist trotz seiner Bibliotheksnutzung sehr sauber und kann entsprechende Merkmale aufweisen (Rückenschild, Instituts-Stempel.). In ENGLISCHER Sprache. Sprache: Englisch Gewicht in Gramm: 865.
-
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Condition: as new. Wie neu/Like new.
-
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. No dust jacket. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,950grams, ISBN:354013722X.
-
Algorithms in Combinatorial Geometry.
Seller: Antiquariat Renner OHG, Albstadt, Germany
Association Member: BOEV
Seller rating 5 out of 5 stars
Hardcover. Condition: Sehr gut. Berlin, Springer (1987). gr.8°. Some figs. XV, 423 p. Hardbound. EATCS Monographs on Theoretical Computer Science, 10.- With exercises.- In good condition.
-
Condition: Sehr gut. Gebundene Ausgabe Sehr gut. Mit Ausnahme von Direkt-Recycling Materialien erfolgt der Versand ohne Einsatz von Kunststoffen. Sprache: Englisch Gewicht in Gramm: 550.
-
Condition: As New. Unread book in perfect condition.
-
Condition: New.
-
Condition: New.
-
-
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 85.99
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Algorithms in Combinatorial Geometry
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Condition: New.
-
Condition: New.
-
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 96.15
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Condition: As New. Unread book in perfect condition.
-
Algorithms in Combinatorial Geometry
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Algorithms in Combinatorial Geometry
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Condition: New. pp. 444.
-
Algorithms in Combinatorial Geometry
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 111.94
£ 15 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Condition: New. pp. 444.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738 ISBN 13: 9783642648731
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer, Springer Vieweg, 1987
ISBN 10: 354013722X ISBN 13: 9783540137221
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field.
-
Condition: new. Questo è un articolo print on demand.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642648738 ISBN 13: 9783642648731
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field. 444 pp. Englisch.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 354013722X ISBN 13: 9783540137221
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of combinatorial geometry. For example, the combinatorial structure of a geometric problem usually decides which algorithmic method solves the problem most efficiently. Furthermore, the analysis of an algorithm often requires a great deal of combinatorial knowledge. As it turns out, however, the connection between the two research areas commonly referred to as computa tional geometry and combinatorial geometry is not as lop-sided as it appears. Indeed, the interest in computational issues in geometry gives a new and con structive direction to the combinatorial study of geometry. It is the intention of this book to demonstrate that computational and com binatorial investigations in geometry are doomed to profit from each other. To reach this goal, I designed this book to consist of three parts, acorn binatorial part, a computational part, and one that presents applications of the results of the first two parts. The choice of the topics covered in this book was guided by my attempt to describe the most fundamental algorithms in computational geometry that have an interesting combinatorial structure. In this early stage geometric transforms played an important role as they reveal connections between seemingly unrelated problems and thus help to structure the field. 444 pp. Englisch.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738 ISBN 13: 9783642648731
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of co.
-
Condition: New. Print on Demand pp. 444 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
-
Algorithms in Combinatorial Geometry
Language: English
Published by Springer Berlin Heidelberg, 1987
ISBN 10: 354013722X ISBN 13: 9783540137221
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Computational geometry as an area of research in its own right emerged in the early seventies of this century. Right from the beginning, it was obvious that strong connections of various kinds exist to questions studied in the considerably older field of co.
-
Condition: New. PRINT ON DEMAND pp. 444.
