This is the revised and expanded 1998 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 edition 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. The code in this 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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
This is the revised and expanded 1998 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 edition 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. The code in this 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.
'... 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
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : GCCebooks, Salinas, CA, Etats-Unis
Paperback. Etat : Acceptable. N° de réf. du vendeur 3UAP3I002KX7
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Very Good. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de réf. du vendeur 10170228-6
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books, Mishawaka, IN, Etats-Unis
Etat : Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good. N° de réf. du vendeur 5445011-6
Quantité disponible : 1 disponible(s)
Vendeur : World of Books (was SecondSale), Montgomery, IL, Etats-Unis
Etat : Good. Item in good condition. Textbooks may not include supplemental items i.e. CDs, access codes etc. N° de réf. du vendeur 00101747839
Quantité disponible : 1 disponible(s)
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
Paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! N° de réf. du vendeur S_469852860
Quantité disponible : 1 disponible(s)
Vendeur : ThriftBooks-Dallas, Dallas, TX, Etats-Unis
Paperback. Etat : Fair. No Jacket. Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less. N° de réf. du vendeur G0521649765I5N00
Quantité disponible : 1 disponible(s)
Vendeur : Pella Books, Pella, IA, Etats-Unis
Trade Paperback. Etat : Used Very Good. N° de réf. du vendeur 244499
Quantité disponible : 1 disponible(s)
Vendeur : Skoob-ebooks, Pontiac, QC, Canada
Softcover. Etat : Very Good. Minor wear only. The pages are clean and crisp with no highlighting or writing detected. The cover is clean with minor shelf wear only. Ships from Canada. Satisfaction guaranteed with 30-day return policy.; 7 X 0.88 X 10 inches; 392 pages; R7 1.1m/872k s1. N° de réf. du vendeur 13365
Quantité disponible : 1 disponible(s)
Vendeur : Books From California, Simi Valley, CA, Etats-Unis
paperback. Etat : Fine. N° de réf. du vendeur mon0003852501
Quantité disponible : 1 disponible(s)
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Etat : Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions. N° de réf. du vendeur Z1-F-075-00892
Quantité disponible : 1 disponible(s)