Hugendubel.de - Das Lesen ist schön

Warenkorb

€ 0,00 0 Buch dabei,
portofrei

Computational Geometry in C

2 Revised edition. 259 b/w illus. 270 exercises. Sprache: Englisch.
Buch (kartoniert)
This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational ... weiterlesen
Buch

43,49*

inkl. MwSt.
Portofrei
Lieferbar innerhalb von zwei Wochen
Computational Geometry in C als Buch
Produktdetails
Titel: Computational Geometry in C
Autor/en: Joseph O'Rourke

ISBN: 0521649765
EAN: 9780521649766
2 Revised edition.
259 b/w illus. 270 exercises.
Sprache: Englisch.
Cambridge University Press

1. Oktober 1998 - kartoniert - 392 Seiten

Beschreibung

This is the newly revised and expanded edition of a popular introduction to the design and implementation of geometry algorithms arising in areas such as computer graphics, robotics, and engineering design. The basic techniques used in computational geometry are all covered: polygon triangulations, convex hulls, Voronoi diagrams, arrangements, geometric searching, and motion planning. The self-contained treatment presumes only an elementary knowledge of mathematics, but reaches topics on the frontier of current research, making it a useful reference for practitioners at all levels. The second editon contains material on several new topics, such as randomized algorithms for polygon triangulation, planar point location, 3D convex hull construction, intersection algorithms for ray-segment and ray-triangle, and point-in-polyhedron. A new 'Sources' chapter points to supplemental literature for readers needing more information on any topic. A novel aspect of the book is the inc lusion of working C code for many of the algorithms, with discussion of practical implementation issues. The code in this new edition is significantly improved from the first edition (more efficient and more robust), and four new routines are included. Java versions for this new edition are also available. All code is accessible from the book's Web site (http://cs.smith.edu/ orourke/) or by anonymous ftp.

Inhaltsverzeichnis

From the contents: 1. Polygon triangulation 2. Polygon partitioning 3. Convex hulls in two dimensions 4. Convex hulls in three dimensions 5. Voronoi diagrams 6. Arrangements 7. Search and intersection 8. Motion planning 9. Sources

Pressestimmen

'... the author does an excellent job of explaining difficult concepts in an accessible, even entertaining, manner ... If this is your field, this is your book!' Developers Review 'The balanced combination of careful descriptions, examples, algorithms and exercises makes it a pleasure to read ...'. Zentralblatt 'Anyone who wants to know what this field is all about should read this book! The book is a pleasure to read, as questions that arise naturally in the reader's mind are answered, in almost all cases, in the following paragraph. The style strikes an ideal balance between rigor and informality. Mr O'Rourke must be a wonderful teacher and I envy his students.' Miriam L. Lucian, Society for Industrial and Applied Mathematics

Mehr aus dieser Reihe

zurück
Nominal Sets
Buch (gebunden)
von Andrew M. (Unive…
Algorithms for the Satisfiability Problem
Buch (gebunden)
von Jun Gu, etc., Pa…
Introduction to Coalgebra
Buch (gebunden)
von Bart Jacobs
Temporal Logics in Computer Science
Buch (gebunden)
von Stephane Demri, …
Modal Logic
Buch (kartoniert)
von Patrick Blackbur…
vor
Servicehotline
089 - 70 80 99 47

Mo. - Fr. 8.00 - 20.00 Uhr
Sa. 10.00 - 20.00 Uhr
Filialhotline
089 - 30 75 75 75

Mo. - Sa. 9.00 - 20.00 Uhr
Bleiben Sie in Kontakt:
Sicher & bequem bezahlen:
akzeptierte Zahlungsarten: Überweisung, offene Rechnung,
Visa, Master Card, American Express, Paypal
Zustellung durch:
* Alle Preise verstehen sich inkl. der gesetzlichen MwSt. Informationen über den Versand und anfallende Versandkosten finden Sie hier.
** im Vergleich zum dargestellten Vergleichspreis.