Curves and surfaces for computer graphics

From MaRDI portal





Computer graphics is important in many areas including engineering design, architecture, medical sciences, education, entertainment, etc. The chief aim of computer graphics is to create realistic-looking objects in the computer. This fact is achieved by computing the outer surface of the objects to be displayed, and rendering them by simulating the way they are seen in real life. Most real objects are visible because they reflect light, so, the main task of rendering is to simulate light reflection. Rendering is therefore an important part of computer graphics, but this book is concerned with the computations of surfaces. In order to render a real object, its surface has first to be calculated and stored in a computer as a mathematical expression. This expression is a mathematical model of the real object and the process of generating this model is usually known as geometric modelling. The rendering algorithm then scans the surface, point by point, computes the normal vector to the surface at every point, and uses the normal to compute the amount and the colour of light reflected by point. The book also deals with curves, because a good understanding of curves is the base point to understanding surfaces. Most mathematical methods for curves can be naturally extended to surfaces and therefore the book covers various approaches to curve design. The most important term in field of curves and surfaces design is interpolation. A typical algorithm for curves starts with a set of points and employs interpolation to compute a smooth curve that passes through these points. Such points are termed data points and they define an interpolating curve. Another important term in this field is approximation. Certain curve and surface methods start with points and vectors and compute a curve or a surface that passes close to the points but not necessarily through them. Such points are known as control points and the curve or the surface defined by them is refered to as an approximating curve or surface. Most chapters of this book describe interpolation and approximation. The first chapter presents basic notions of the theory of curves and surfaces. In the next chapter the author introduces the simplest curves and surfaces, such as straight lines, flat planes, triangles, bilinear and lofted surfaces. Chapter 3 discusses polynomial interpolation (namely, given a set of points, the problem is to compute a polynomial that passes through them). This problem is then extended to a surface patch that passes through a given two-dimensional set of points. The following two chapters are dedicated to Hermite and spline interpolations. The author discusses cubic and higher order Hermite interpolation curve segments, special and degenerate Hermite segments, Hermite interpolation curves, the Ferguson surface patch, the Coons surface patch, the bicubic surface patch, Gordon surfaces, cubic splines, cardinal splines, Kochanek-Bartels splines, spline surface patches and cardinal spline patches. Chapter 6 is dedicated to Bézier methods for curves and surfaces. The Bernstein form of the Bézier curve is introduced and then it is described the de Casteljau contruction. Rational Bézier curves have important advantages and are assigned a separate section. The last of the interpolation/approximation chapters, Chapter 7, is devoted to all important B-spline technique. B-spline curve topics are: the quadratic uniform B-spline curve, the cubic uniform B-spline curve, multiple control points, cubic B-splines with tension, higher degree uniform B-splines, interpolating B-splines, open uniform B-spline, non-uniform B-splines, matrix form of the nonuniform B-spline curve, subdividing the B-spline curve and NURBS. The B-spline surface topics are: uniform B-spline surfaces, an interpolating bicubic patch and a quadratic-cubic B-spline patch. In Chapter 8 there are discussed subdivision methods for curves and surfaces. These methods are also based on interpolation, but are different from traditional interpolation methods presented in previous chapters. Some important techniques are discussed: the de Casteljau refinement process, Chaikin's algorithm, the quadratic uniform B-spline curve, the cubic uniform B-spline curve, biquadratic B-spline patches, bicubic B-spline patches, Doo-Sabin subdivision methods, Catmull-Clark surfaces and Loop subdivision surfaces. The last chapter presents various types of sweep surfaces; they are generated by constructing a curve and moving it along another curve, while optionally also rotating and scaling it, to create a surface patch. The book ends with four Appendices containing simple methods for the approximate representation of circles by polynomials, colour images of some interesting surfaces and some Mathematica codes. The book aims to be either theoretical or practical; after reading and understanding a topic, the reader should be able to design and implement the concepts discussed. The materiar presented in this book requires no previous knowledge of curves, spline or surfaces. The notions are clearly introduced and are investigated, when possible, from several points of view and are illustrated by figures and examples. The mathematical background requires elementary calculus. The book has many examples, which are important for a better understanding of the presented concepts; many examples are also accompanied by Mathematica codes. Many exercises are sprinkled throughout the text. These are also important and should be worked out. The answers are also provided in the end of the book.




Cited in
(56)


Describes a project that uses

Uses Software






This page was built for publication: Curves and surfaces for computer graphics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5705383)