Low Price Guarantee
We Take School POs
Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Geometric Modeling
Contributor(s): Goldman, Ron (Author)

View larger image

ISBN: 1558603549     ISBN-13: 9781558603547
Publisher: Morgan Kaufmann Publishers
Retail: $142.00OUR PRICE: $103.66  
  Buy 25 or more:OUR PRICE: $95.14   Save More!
  Buy 100 or more:OUR PRICE: $90.88   Save More!


  WE WILL NOT BE UNDERSOLD!   Click here for our low price guarantee

Binding Type: Hardcover - See All Available Formats & Editions
Published: July 2002
Qty:
Temporarily out of stock - Will ship within 2 to 5 weeks

Annotation: Ideal as a comprehensive introduction to fundamental algorithms for basic curves and surfaces, or for a deeper understanding of entities with which readers may be familiar, this book presents a simple approach to the entire structure of algorithms.

Click for more in this series: The Morgan Kaufmann Computer Graphics
Additional Information
BISAC Categories:
- Computers | Programming - Algorithms
- Computers | Computer Graphics
Dewey: 006.6
LCCN: 2002107240
Series: The Morgan Kaufmann Computer Graphics
Physical Information: 1.25" H x 7.6" W x 9.6" L (2.62 lbs) 576 pages
Features: Illustrated, Index
 
Descriptions, Reviews, Etc.
Publisher Description:


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.

 
Customer ReviewsSubmit your own review
 
To tell a friend about this book, you must Sign In First!