Average Reviews:
(More customer reviews)This is a great book, definitely the best among the various books on geometric design and CAGD (other good ones include Farin, Mortsenson, Piegl and Tiller, Hoscheck and Lasser). It is not as encyclopedic as the sources listed above, but it a lot more coherent and a lot clearer, because it follows the unifying concept of blossoming. As a result, one gets multiple complementary views of polynomial curves and surfaces: algebraic, geometric, combinatorial, and algorithmic. For example, we can see where the Bernstein polynomials come from, instead of mysteriously being dropped from the sky. The systematic use of blossoms (polar forms) is particularly elegant in the presentation of surfaces, where it clarifies greatly the differences between rectangular and triangular patches. The discussion of subdivision versions of the de Casteljau algorithm is very thorough and unique. Gallier's book is also the only book to discuss subdivision surfaces in some detail (Doo-Sabin, Catmull-Clark, and Loop). In particular, an analysis of the convergence of Loop's scheme is given. For this, the author gives a remarkable crash course on the discrete Fourier transform. However, this chapter is too dense and should have been split. Also, much more pictures are needed. It seems that the author was in a rush. The appendix on vector spaces is gorgeous, and the one on differentials is also excellent. This book is highly recommended to mathematically inclined readers interested in geometric modeling and computer graphics. Too bad that applications to medicine such as organ modeling, or to computer animation, are not presented. Nevertheless, Mathematica code is provided for most of the algorithms. A web site would be helpful.
Click Here to see more reviews about: Curves and Surfaces in Geometric Modeling: Theory & Algorithms (The Morgan Kaufmann Series in Computer Graphics)
Curves and Surfaces for Geometric Design offers both a theoretically unifying understanding of polynomial curves and surfaces and an effective approach to implementation that you can bring to bear on your own work-whether you're a graduate student, scientist, or practitioner.
Inside, the focus is on "blossoming"-the process of converting a polynomial to its polar form-as a natural, purely geometric explanation of the behavior of curves and surfaces.This insight is important for far more than its theoretical elegance, for the author proceeds to demonstrate the value of blossoming as a practical algorithmic tool for generating and manipulating curves and surfaces that meet many different criteria.You'll learn to use this and related techniques drawn from affine geometry for computing and adjusting control points, deriving the continuity conditions for splines, creating subdivision surfaces, and more.
The product of groundbreaking research by a noteworthy computer scientist and mathematician, this book is destined to emerge as a classic work on this complex subject.It will be an essential acquisition for readers in many different areas, including computer graphics and animation, robotics, virtual reality, geometric modeling and design, medical imaging, computer vision, and motion planning.
* Achieves a depth of coverage not found in any other book in this field.* Offers a mathematically rigorous, unifying approach to the algorithmic generation and manipulation of curves and surfaces. * Covers basic concepts of affine geometry, the ideal framework for dealing with curves and surfaces in terms of control points.* Details (in Mathematica) many complete implementations, explaining how they produce highly continuous curves and surfaces.* Presents the primary techniques for creating and analyzing the convergence of subdivision surfaces (Doo-Sabin, Catmull-Clark, Loop).* Contains appendices on linear algebra, basic topology, and differential calculus.
No comments:
Post a Comment