Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Edelsbrunner, Herbert
ISBN 10: 354013722X ISBN 13: 9783540137221
Published by Springer, 1987
New
Hardcover
From
Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
AbeBooks Seller since 25 March 2015
This specific item is no longer available.
About this Item
Description:
In. Seller Inventory # ria9783540137221_new
Synopsis:
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.
Synopsis: This book offers a modern approach to computational geo-metry, an area thatstudies the computational complexity ofgeometric problems. Combinatorial investigations play animportant role in this study.
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: Algorithms in Combinatorial Geometry (...
Publisher: Springer
Publication Date: 1987
Binding: Hardcover
Condition: New
Top Search Results from the AbeBooks Marketplace
Stock Image
Algorithms in Combinatorial Geometry
Seller: BuchKaffee Vividus e.K., Tuebingen, Germany
Seller rating 4 out of 5 stars
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. Seller Inventory # 34243
Stock Image
Algorithms in Combinatorial Geometry (EATCS Monographs on Theoretical Computer Science) (Volume 10)
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
Condition: Good. Volume 10. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. Clean from markings 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. Seller Inventory # 9435900
Buy Used
£ 22.83
£ 13.40 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Algorithms in Combinatorial Geometry
Seller: Anybook.com, Lincoln, United Kingdom
Seller rating 5 out of 5 stars
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. Seller Inventory # 4145203
Buy Used
£ 42.02
£ 13.40 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available
Stock Image
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Published by
Springer (edition 1987), 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Used
Hardcover
Seller: BooksRun, Philadelphia, PA, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Good. 1987. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience. Seller Inventory # 354013722X-11-1
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
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. Seller Inventory # 4882291
Buy New
£ 81.38
£ 43.01 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Algorithms in Combinatorial Geometry
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. Algorithms in Combinatorial Geometry | Herbert Edelsbrunner | Buch | xv | Englisch | 1987 | Springer Berlin | EAN 9783540137221 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 102152843
Stock Image
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020160294
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
New
Hardcover
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Buch. Condition: Neu. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 444 pp. Englisch. Seller Inventory # 9783540137221
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9783540137221
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
New
Hardcover
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. Seller Inventory # 9783540137221