Vertices of bezier curve find out 3 points on bezier curve, Computer Graphics

Specified p0 (1, 1): p1 (2, 3); p2 (4, 3); p3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve?

Solution: We consider Cubic Bezier curve as:

P (u) = p0 (1 - u)3 + 3p1 u (1 - u)2 + 3p2 u2 (1 - u) + p3u3

P (u) = (1, 1) (1 - u)3   + 3 (2, 3)u (1 - u)2 + 3 (4, 3) u2 (1 - u) + (3, 1)u3. we select various values of u from 0 to 1.

u = 0:   P (0) = (1, 1) (1 - 0)3 + 0 + 0 + 0 = (1, 1)

u = 0.5:  P (0.5) = (1, 1)(1 - 0.5)3+3(2, 3)(0.5) (1 - 0.5)2 + 3 (4, 3)(0.5)2(1 - 0.5)+(3,1) (0.5)3

= (1, 1) (0.5)3 + (2, 3) (0.375) + (0.375) (4, 3) + (3, 1) (0.125)

= (0.125, 0.125) +  (0.75, 1.125) + (1.5, 1.125) + (1.125, 0.125) P (0.5) = (3.5, 2.5)

u = 1:  P (1) = 0 + 0 + 0 + (3, 1). 13

= (3, 1)

Posted Date: 4/4/2013 5:23:11 AM | Location : United States







Related Discussions:- Vertices of bezier curve find out 3 points on bezier curve, Assignment Help, Ask Question on Vertices of bezier curve find out 3 points on bezier curve, Get Answer, Expert's Help, Vertices of bezier curve find out 3 points on bezier curve Discussions

Write discussion on Vertices of bezier curve find out 3 points on bezier curve
Your posts are moderated
Related Questions
Computer Aided Design and Drafting CADD or CAD stands for Computer Aided Design and Drafting. This is different from both "draw" and "paint" programs in which measurement is c

QUESTION (a) What are the main purposes of using master pages? (b) How do you select a master page item on a document page? (c) How do you resize a graphics frame and its

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

Implement displacement mapping and bump mapping on a sphere. The displacement can be whatever your choice. The bump map can be whatever your choice as well.

Question : You have been approached to design a ‘tuck top auto-lock bottom' carton package for a high-end cosmetic jar under the brand name ‘Beauty One'. Your client asked you

2D Clipping Algorithms Clipping is an operation that eliminates invisible objects from the view window.  To understand clipping, recall that when we take a snapshot of a scene,

Sutherland-Hodgman Algorithm Any polygon of any type of arbitrary shape can be explained with the assist of some set of vertices connected with it. While we try to clip the po

Role in Education and Training:- A multimedia presentation is an important way to introduce new concepts or described a new technology. Individuals determine it easy to understand

Combined consequence of ambient and diffused reflection At this time the resulting intensity I will be the total sum of the intensities in case 8.3.2 and 8.3.3 we find that: