DOC PREVIEW
UCSD CSE 167 - Curved Surfaces

This preview shows page 1-2-3-19-20-38-39-40 out of 40 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 40 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

Curved SurfacesCurve Evaluationde Casteljau AlgorithmSlide 4Slide 5Slide 6Bezier CurveRecursive Linear InterpolationExpanding the LerpsBernstein PolynomialsCubic Equation FormCubic Matrix FormSlide 13Matrix FormDerivativesTangentsBezier SurfacesSlide 18Control MeshSurface EvaluationSlide 21Slide 22Slide 23Slide 24Slide 25Slide 26NormalsBezier Surface PropertiesTessellationUniform TessellationAdaptive TessellationMixed TessellationDisplacement MappingScan ConversionTransparencyScanline RenderingSlide 37Surface RenderersSlide 39Other Curve TypesCurved SurfacesCSE167: Computer GraphicsInstructor: Steve RotenbergUCSD, Fall 2006Curve Evaluationp0p1p2p3Find the point x on the curve as a function of parameter t:x(t)•de Casteljau Algorithmp0p1p2p3We start with our original set of pointsIn the case of a cubic Bezier curve, we start with four pointsde Casteljau Algorithmp0q0p1p2p3q2q1   322211100,,,,,,ppqppqppqtLerptLerptLerp   baba tttLerp  1,,de Casteljau Algorithmq0q2q1r1r0  211100,,,,qqrqqrtLerptLerpde Casteljau Algorithmr1xr0• 10,, rrx tLerpBezier Curvex•p0p1p2p3Recursive Linear Interpolation   322211100,,,,,,ppqppqppqtLerptLerptLerp  211100,,,,qqrqqrtLerptLerp 10,, rrx tLerp3210pppp210qqq10rrx3210ppppExpanding the Lerps                                               3221211010322121121101003232221211101001111111,,111,,111,,1,,1,,1,,pppppppprrxppppqqrppppqqrppppqppppqppppqtttttttttttttttLe rptttttttLer ptttttttLerptttLer ptttLerptttLerpBernstein Polynomials                     !!!133363133363363133333233223312330333223123023inininttintBttBtttBttttBttttBtBttttttttttttiinniiipxppppxCubic Equation Form          010210321023010221033210333633313336333pdppcpppbppppadcbaxppppppppppxttttttCubic Matrix Form    0102103210233336333pdppcpppbppppadcbax ttt 32102300010033036313311ppppdcbadcbax tttCubic Matrix Form  zyxzyxzyxzyxpppppppppppptttttt333222111000233210230001003303631331100010033036313311xppppxMatrix Form CtxGBtxxBezBezzyxzyxzyxzyxppppppppppppttt3332221110002300010033036313311DerivativesFinding the derivative (tangent) of a curve is easy:cbaxdcbax  ttdtdttt 23223   dcbaxdcbax 01231223ttdtdtttTangentsThe derivative of a curve represents the tangent vector to the curve at some point tdtdx txBezier SurfacesBezier surfaces are a straightforward extension to Bezier curvesInstead of the curve being parameterized by a single variable t, we use two variables, s and tBy definition, we choose to have s and t range from 0 to 1 and we say that an s-tangent crossed with a t-tangent will represent the normal for the front of the surfacest0,01,11,00,1nCurved SurfacesThe Bezier surface is a type of parametric surfaceA parametric surface is a surface that can be parametrized by two variables, s and tParametric surfaces have a rectangular topologyIn computer graphics, parametric surfaces are sometimes called patches, curved surfaces, or just surfacesThere are also some non-parametric surfaces used in computer graphics, but we won’t consider those nowControl MeshConsider a bicubic Bezier surface (bicubic means that it is a cubic function in both the s and t parameters)A cubic curve has 4 control points, and a bicubic surface has a grid of 4x4 control points, p0 through p15p0p1p2p3p4p5p6p7p8p9p10p11p12p13p14p15stSurface EvaluationThe bicubic surface can be thought of as 4 curves along the s parameter (or alternately as 4 curves along the t parameter)To compute the location of the surface for some (s,t) pair, we can first solve each of the 4 s-curves for the specified value of sThose 4 points now make up a new curve which we evaluate at tAlternately, if we first solve the 4 t-curves and to create a new curve which we then evaluate at s, we will get the exact same answerThis gives a pretty straightforward way to implement smooth surfaces with little more than what is needed to implement curvesst(0.2, 0.6)Matrix FormWe saw the matrix form for a 3D Bezier curve is CtxGBtxxBezBezzyxzyxzyxzyxppppppppppppttt3332221110002300010033036313311Matrix FormTo simplify notation for surfaces, we will define a matrix equation for each of the x, y, and z components, instead of combining them into a single equation as for curvesFor example, to evaluate the x component of a Bezier curve, we can use: xxBezxxxxxxpppptttxctgBt32102300010033036313311Matrix FormTo evaluate the x component of 4 curves simultaneously, we can combine 4 curves into a 4x4 matrixTo evaluate a surface, we evaluate the 4 curves, and use them to make a new curve which is then evaluatedThis can be written in a compact matrix form:   11,2323tttssstsxTTBezxBeztstBGBsMatrix Form  


View Full Document

UCSD CSE 167 - Curved Surfaces

Documents in this Course
Lighting

Lighting

38 pages

Review

Review

59 pages

Surfaces

Surfaces

22 pages

Review

Review

110 pages

Midterm

Midterm

4 pages

Lighting

Lighting

38 pages

Lighting

Lighting

71 pages

Review

Review

110 pages

Lighting

Lighting

71 pages

Load more
Download Curved Surfaces
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Curved Surfaces and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Curved Surfaces 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?