Pyramid Algorithms: A Dynamic Programming Approach to Curves and Surfaces for Ge

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.  

Contents

Chapter 1. Foundations  
Chapter 2. Lagrange Interpolation and Neville's Algorithm  
Chapter 3. Hermite Interpolation and the Extended Neville Algorithm  
Chapter 4. Newton Interpolation and Difference Triangles  
Chapter 5. Bezier Approximation and Pascal's Triangle  
Chapter 6. Blossoming  
Chapter 7. B-Spline Approximation and the de Boor Algorithm  
Chapter 8. Pyramid Algorithms for Multi-Sided Bezier Patches  

《金字塔算法》提供了一种独特的方法来理解、分析和计算计算机辅助几何设计中最常用的多项式和样条曲线和曲面方案，采用基于递归金字塔的动态规划方法。递归金字塔方法具有明显的优势，可以一目了然地展示算法的整个结构以及它们之间的关系。这本书是唯一以这种方法为基础的书籍，肯定会改变您对计算机辅助几何设计的思考方式和执行方式，而且只需要基本的微积分和线性代数背景以及简单的编程技能。

目录：
第1章 基础
第2章 拉格朗日插值和内维尔算法
第3章 埃尔米特插值和扩展内维尔算法
第4章 牛顿插值和差分三角形
第5章 贝塞尔逼近和帕斯卡三角形
第6章 开花
第7章 B样条逼近和de Boor算法
第8章 金字塔算法用于多边贝塞尔片