Pyramid Algorithms presents a unique approach to understanding, analyzing, and computing the most common polynomial and spline curve and surface schemes used in computer-aided geometric design, employing a dynamic programming method based on recursive pyramids.The recursive pyramid approach offers the distinct advantage of revealing the entire structure of algorithms, as well as relationships between them, at a glance. This book-the only one built around this approach-is certain to change the way you think about CAGD and the way you perform it, and all it requires is a basic background in calculus and linear algebra, and simple programming skills.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Ron Goldman is a researcher at Sun Microsystems Laboratories in California working on alternative software development methodologies and new software architectures inspired by biology. He has been working with open source since hacking on GDB at Lucid, Inc. back in 1992. Since 1998 he has been helping groups at Sun Microsystems understand open source and advising them on how to build successful communities around their open source projects. Prior to Sun he developed a program to generate and manipulate visual representations of complex data for use by social scientists as part of a collaboration between NYNEX Science & Technology and the Institute for Research on Learning. He has worked on programming language design, programming environments, user interface design, and data visualization. He has a PhD in computer science from Stanford University where he was a member of the robotics group.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : HPB-Red, Dallas, TX, Etats-Unis
hardcover. 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_393308067
Quantité disponible : 1 disponible(s)
Vendeur : Better World Books: West, Reno, NV, Etats-Unis
Etat : Very Good. 1st Edition. Used book that is in excellent condition. May show signs of wear or have minor defects. N° de réf. du vendeur GRP82458062
Quantité disponible : 1 disponible(s)
Vendeur : Solr Books, Lincolnwood, IL, Etats-Unis
Etat : very_good. This books is in Very good condition. There may be a few flaws like shelf wear and some light wear. N° de réf. du vendeur 5D4000008T9P_ns
Quantité disponible : 1 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
Hardcover. Etat : New. N° de réf. du vendeur 6666-ELS-9781558603547
Quantité disponible : Plus de 20 disponibles
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur 6a168e43adcde4790c862a579cc2c2d6
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. pp. xxiii + 551 Illus. N° de réf. du vendeur 8339564
Quantité disponible : 3 disponible(s)
Vendeur : Anybook.com, Lincoln, Royaume-Uni
Etat : 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,1250grams, ISBN:9781558603547. N° de réf. du vendeur 9491736
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 551 pages. 9.50x7.75x1.25 inches. In Stock. N° de réf. du vendeur __1558603549
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. pp. xxiii + 551 1st Edition. N° de réf. du vendeur 26589747
Quantité disponible : 3 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. pp. xxiii + 551. N° de réf. du vendeur 18589753
Quantité disponible : 3 disponible(s)