Items related to Algorithms in Combinatorial Geometry: 10 (Monographs...
Algorithms in Combinatorial Geometry: 10 (Monographs in Theoretical Computer Science. An EATCS Series, 10) - Softcover
Synopsis
Algorithms in Combinatorial Geometry This book offers a modern approach to computational geo- metry, an area thatstudies the computational complexity of geometric problems. Combinatorial investigations play an important role in this study.
"synopsis" may belong to another edition of this title.
- PublisherSpringer
- Publication date2011
- ISBN 10 3642648738
- ISBN 13 9783642648731
- BindingPaperback
- LanguageEnglish
- Number of pages438
Buy New
View this item
£ 87.22
£ 11.98 shipping from United Kingdom to U.S.A.
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Algorithms in Combinatorial Geometry: 10 (Monographs...
Stock Image
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
Condition: New. In. Seller Inventory # ria9783642648731_new
Quantity: Over 20 available
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg Sep 2011, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
New
Taschenbuch
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. Seller Inventory # 9783642648731
Quantity: 2 available
Stock Image
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLING22Oct2817100464616
Quantity: Over 20 available
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
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. Seller Inventory # 9783642648731
Quantity: 1 available
Seller Image
Algorithms in Combinatorial Geometry
Published by
Springer Berlin Heidelberg, 2011
ISBN 10: 3642648738
ISBN 13: 9783642648731
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 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 # 5067081
Quantity: Over 20 available