Book contents
- Frontmatter
- Note to the Reader
- Preface
- Contents
- 1 Transformations and their Iteration
- 2 Arithmetic and Geometric Means
- 3 Isoperimetric Inequality for Triangles
- 4 Isoperimetric Quotient
- 5 Colored Marbles
- 6 Candy for School Children
- 7 Sugar Rather Than Candy
- 8 Checkers on a Circle
- 9 Decreasing Sets of Positive Integers
- 10 Matrix Manipulations
- 11 Nested Triangles
- 12 Morley's Theorem and Napoleon's Theorem
- 13 Complex Numbers in Geometry
- 14 Birth of an IMO Problem
- 15 Barycentric Coordinates
- 16 Douglas-Neumann Theorem
- 17 Lagrange Interpolation
- 18 The Isoperimetric Problem
- 19 Formulas for Iterates
- 20 Convergent Orbits
- 21 Finding Roots by Iteration
- 22 Chebyshev Polynomials
- 23 Sharkovskii's Theorem
- 24 Variation Diminishing Matrices
- 25 Approximation by Bernstein Polynomials
- 26 Properties of Bernstein Polynomials
- 27 Bézier Curves
- 28 Cubic Interpolatory Splines
- 29 Moving Averages
- 30 Approximation of Surfaces
- 31 Properties of Triangular Patches
- 32 Convexity of Patches
- Appendix A Approximation
- Appendix B Limits and Continuity
- Appendix C Convexity
- Bibliography
- Hints and Solutions
- Index
30 - Approximation of Surfaces
- Frontmatter
- Note to the Reader
- Preface
- Contents
- 1 Transformations and their Iteration
- 2 Arithmetic and Geometric Means
- 3 Isoperimetric Inequality for Triangles
- 4 Isoperimetric Quotient
- 5 Colored Marbles
- 6 Candy for School Children
- 7 Sugar Rather Than Candy
- 8 Checkers on a Circle
- 9 Decreasing Sets of Positive Integers
- 10 Matrix Manipulations
- 11 Nested Triangles
- 12 Morley's Theorem and Napoleon's Theorem
- 13 Complex Numbers in Geometry
- 14 Birth of an IMO Problem
- 15 Barycentric Coordinates
- 16 Douglas-Neumann Theorem
- 17 Lagrange Interpolation
- 18 The Isoperimetric Problem
- 19 Formulas for Iterates
- 20 Convergent Orbits
- 21 Finding Roots by Iteration
- 22 Chebyshev Polynomials
- 23 Sharkovskii's Theorem
- 24 Variation Diminishing Matrices
- 25 Approximation by Bernstein Polynomials
- 26 Properties of Bernstein Polynomials
- 27 Bézier Curves
- 28 Cubic Interpolatory Splines
- 29 Moving Averages
- 30 Approximation of Surfaces
- 31 Properties of Triangular Patches
- 32 Convexity of Patches
- Appendix A Approximation
- Appendix B Limits and Continuity
- Appendix C Convexity
- Bibliography
- Hints and Solutions
- Index
Summary
Computer-aided geometric design focuses on the representation and design of surfaces in a computer graphics environment. A popular way to represent surfaces in such an environment is with Bézier surface patches. In this chapter we extend most of the results about Bernstein polynomials and Bézier curves to surfaces.
We have seen in Fig. 27.2 how complicated curved shapes can be defined by joining together several Bézier curves. Each is really a segment of a curve, restricted to parameter values 0 ≤ t ≤ 1. Similarly, Bézier surface patches are portions of surfaces that can be pieced together to form complicated shapes. The two most common Bézier patches are called “three-sided” (or, triangular) and “four-sided” (or, rectangular). Of course, these are not triangles and rectangles in the traditional sense, but regions of surfaces with three- or four-sided boundaries.
The conceptually simplest way of extending the univariate Bernstein polynomials to several variables is to use rectangular patches. (See [Lorentz '531.) We want to approximate a function f(x, y) in the square 0 ≤ x ≤ 1, 0 ≤ y ≤ 1, using values of f on the grid points x = i/m, y = j/n where m, n are positive integers and i = 0, 1, …, m, j = 0, 1, …, n. We replace, for each fixed y, f(x, y) as a function of x by its mth degree Bernstein approximant.
- Type
- Chapter
- Information
- Over and Over Again , pp. 216 - 224Publisher: Mathematical Association of AmericaPrint publication year: 1997