Pyramid Algorithm: Dynamic Programming Processing of Curved Surface Geometric Models

Author: Goldman
Publisher:
Publish Date: 2004-01-01
Features: This is the only book on the pyramid algorithm. The pyramid algorithm is a highly effective method that employs a dynamic programming approach based on pyramid recursion to understand, analyze, and compute common polynomial and spline curve surface problems in computer-aided geometric design. Pyramid recursive algorithms have a clear advantage in displaying the overall structure of the algorithm, making it easy to see the connections between them. Learning this method only requires basic knowledge of differential geometry and linear algebra, as well as simple programming skills. After reading this book, readers are bound to change their approach and implementation methods for computer-aided geometric design. This book is the only one on the pyramid algorithm. Dr. Goldman is one of the most outstanding academic researchers in computer-aided geometric design in the world, with extensive practical experience. The book introduces the fundamental concepts, methods, and intrinsic connections of computer-aided geometric design, as well as the specific details of dynamic programming for curve and surface geometric models, covering Bézier curves, B-splines, blossoms, and various Bézier surface patches. The explanations in the book are easy to understand, and each section includes theoretical and practical exercises to reinforce the knowledge presented. The content of the book is arranged in a logical and progressive manner, from simple to complex, making it easy to follow. After reading it, readers will gain a clear understanding and realize that computer-aided geometric design and its implementation methods are actually quite straightforward. With the authority of its author and the importance of its content, this book truly rivals the pyramid in its significance. This book is suitable for theoretical scholars and practical application personnel in fields such as computer science, engineering, and mathematics, as well as upper-level undergraduate and graduate students in computer science.