A Dynamic Programming Approach to Curves and Surfaces for Geometric ModelingBy
- Ron Goldman
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.
mechanical engineers, computer scientists, and applied mathematicians; researchers and developers in geometric modeling, computer graphics, and computer-aided geometric design; practitioners in industry who design and implement computer-aided design and computer graphics software; theoreticians in academia interested in exploring and extending the foundations of geometric modeling and computer graphics.
Hardbound, 576 Pages
Published: July 2002
Imprint: Morgan Kaufmann
"Ron Goldman is a leading expert who knows the fundamental concepts and their interconnectedness, as well as the small details. The elegance of the writing and of the methods used to present the material allows us to get a deep understanding of the central concepts of CAGD. In its simplicity and pure beauty, the theory indeed resembles the pyramids."
Helmut Pottman, Vienna University of Technology
"A textbook approach to understanding, analyzing and computing common polynomial and spline curves, and surfaces schemes in computer-aided geometric modeling and design. Goldman employs a dynamic programming method based on recursive pyramids for revealing the structure and relationship of algorithms." - Design Issue
- 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