Scribd
Upload
35 views10 pages

Curve and Surface: Prof. Ehsan T Esfahani Spring 2016

This document discusses Bezier curves and surfaces. It introduces Bezier approximation, which employs control points to produce an approximating curve that does not pass through interior points but is attracted by them. Each point influences the curve's direction by pulling it toward itself strongest when nearest the point. The mathematical expression depends on number of points, not just the points themselves. Examples and the historical background of CAD/CAM pioneers Pierre Bezier and Paul de Casteljau are also presented.

Uploaded by

Zurina MA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
35 views10 pages

Curve and Surface: Prof. Ehsan T Esfahani Spring 2016

This document discusses Bezier curves and surfaces. It introduces Bezier approximation, which employs control points to produce an approximating curve that does not pass through interior points but is attracted by them. Each point influences the curve's direction by pulling it toward itself strongest when nearest the point. The mathematical expression depends on number of points, not just the points themselves. Examples and the historical background of CAD/CAM pioneers Pierre Bezier and Paul de Casteljau are also presented.

Uploaded by

Zurina MA
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

CURVE AND SURFACE

Lecture 13 Prof. Ehsan T Esfahani


Spring 2016

Bezier Approximation
The method employs control points and produces an

approximating curve
The curve does not pass through the interior points but

is attracted by them
Each point influences the direction of the curve by pulling

it toward itself, and that influence is strongest when the


curve gets nearest the point.
Mathematical expression of the curve depends on

the number of points, not just on the points themselves

Examples

Historical Background
The Start of CAD/CAM (1959~60s)

Pierre tienne Bzier


1910-1999
UNISURF CAD CAM System

Paul de Casteljau
1930-

Renault 4CV (1947 1961)

Bezier properties
The control polygon : polygon obtained by connecting control points

Bezier Curve Requirements


1. The curve should start at point P0 moving toward P1. A similar property should hold
at the last point.
Passes through the first and last control points.
Initial tangent: P1 P0,

2.

final tangent: Pn-1 Pn

Continuity at the knots (two ends) between separate Bezier curve segments
Higher derivatives requirements at the two extreme endpoints: . Kth derivative at P(0) should

only depend on P0 and its k neighbors P1 through Pk.


3.

Reversal of the sequence of control points would not affect the shape of the curve
The weight functions should be symmetric with respect to t and (1 t).

4.

The entire curve lies within the convex hull of the set of control points.

5.

Shape of the curve is independent of the coordinate system.


The weights should be barycentric

In search for such functions


Bezier and de Casteljau independently used Bernstein
Polynomials introduced in 1912.

Sergei Natanovich Bernstein


1880-1968

Bernstein Curve

n =2, 3 control points

They have all Bezier requirements


Barycentric
@ t = 0 B1=1 and B2 = B3 = = Bn =0
@ t = 1 Bn=1 and Bn-1 = Bn-1 = = B1 =0

n =3, 4 control points

n =4, 5 control points

General Representation of Bezier Curve


For n+1 control point

Check N for some values

Some Examples
What is a Bezier curve with two points?
Show the similarities of Bezier curve with three points to

Hermit Interpolations.
Given the curve P(t) = (1 + t + t2,t3), find its control points.

Read Page 184-193

New Notation
The Bezier curve can also be represented in a compact

and elegant way as P(t) = (tE + (1 t ))n P0,


E is the shift operator:

Example:

n=2

E Pi = Pi+1

You might also like