Verwandte Artikel zu Algorithms in Combinatorial Geometry: 10 (Monographs...
Algorithms in Combinatorial Geometry: 10 (Monographs in Theoretical Computer Science. An EATCS Series) - Hardcover
Inhaltsangabe
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.
Die Inhaltsangabe kann sich auf eine andere Ausgabe dieses Titels beziehen.
Reseña del editor
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.
Reseña del editor
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.
„Über diesen Titel“ kann sich auf eine andere Ausgabe dieses Titels beziehen.
Neu kaufen
Diesen Artikel anzeigen
EUR 89,99
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & DauerWeitere beliebte Ausgaben desselben Titels
Suchergebnisse für Algorithms in Combinatorial Geometry: 10 (Monographs...
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry
Anbieter: BuchKaffee Vividus e.K., Tuebingen, Deutschland
Verkäuferbewertung 4 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 34243
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry (Monographs in Theoretical Computer Science. An EATCS Series, 10)
Verlag:
Springer (edition 1987), 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Gebraucht
Hardcover
Anbieter: BooksRun, Philadelphia, PA, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Good. 1987. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Bestandsnummer des Verkäufers 354013722X-11-1
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry
Anbieter: ThriftBooks-Dallas, Dallas, TX, USA
Verkäuferbewertung 5 von 5 Sternen
Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.9. Bestandsnummer des Verkäufers G354013722XI4N00
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry (EATCS Monographs on Theoretical Computer Science) (Volume 10)
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 9435900
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry
Anbieter: Anybook.com, Lincoln, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 4145203
Anzahl: 1 verfügbar
Foto des Verkäufers
Algorithms in Combinatorial Geometry
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 4882291
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Algorithms in Combinatorial Geometry
ISBN 10: 354013722X
ISBN 13: 9783540137221
Neu
Hardcover
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783540137221
Anzahl: 2 verfügbar
Foto des Verkäufers
Algorithms in Combinatorial Geometry
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783540137221
Anzahl: 1 verfügbar
Foto des Verkäufers
Algorithms in Combinatorial Geometry
Verlag:
Springer Berlin Heidelberg Jul 1987, 1987
ISBN 10: 354013722X
ISBN 13: 9783540137221
Neu
Hardcover
Anbieter: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Buch. Zustand: 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. Bestandsnummer des Verkäufers 9783540137221
Anzahl: 2 verfügbar
Beispielbild für diese ISBN
Algorithms in Combinatorial Geometry
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 444. Bestandsnummer des Verkäufers 26324716
Anzahl: 1 verfügbar