Pyramid algorithms : a dynamic programming approach to curves and surfaces for geometric modeling
Author(s)
Bibliographic Information
Pyramid algorithms : a dynamic programming approach to curves and surfaces for geometric modeling
（The Morgan Kaufmann series in computer graphics and geometric modeling）
Morgan Kaufmann, c2003
Available at / 11 libraries
-
No Libraries matched.
- Remove all filters.
Note
Includes index
Description and Table of Contents
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.
Table of Contents
Chapter 1. FoundationsChapter 2. Lagrange Interpolation and Neville's AlgorithmChapter 3. Hermite Interpolation and the Extended Neville AlgorithmChapter 4. Newton Interpolation and Difference TrianglesChapter 5. Bezier Approximation and Pascal's TriangleChapter 6. BlossomingChapter 7. B-Spline Approximation and the de Boor AlgorithmChapter 8. Pyramid Algorithms for Multi-Sided Bezier Patches
by "Nielsen BookData"