Important points about the curve segment, Computer Graphics

Assignment Help:

Important Points about the Curve segment - properties of bezier curves

Note: if P (u) → = Bezier curve of sequence n and Q (u) → Bezier curve of sequence m.

After that Continuities in between P(u) and Q(u) are as:

1)      Positional continuity of 2 curves

892_Important Points about the Curve Segment.png

That is pn = q0

2)       C1 continuity of 2 curve P (u) and Q (u) as that point pn - 1, pn on curve P(u) and q0, q1 points upon curve Q(u) are collinear that is:

n( pn  - pn-1 ) = m(q1 - q0 )

n q1  = q0  +( pn  - pn -1 ).(n/m)

 ⇒ (d p/du)u=1         =  (d q/dv)v=0

G(1)  continuity of two curves P(u) and Q(u) at the joining that are the end of P(u) along with the beginning of q(u) as:

pn  = q0n( pn  - pn -1 ) = kn(q1  - q0 ),

Here k is a constant and k > 0

⇒ pn -1 , p­  = q0 , q1  are collinear

3)  c2 continuity is:

a)   C(1) continuity

b)   m (m - 1) (q0 - 2q1 + q2)

= n (n - 1) (pn - 2pn - 1 + pn - 2)

That points are as: pn - 2, pn - 1, pn of P(u) and points q0 , q1, q2 of Q(u) should  be collinear further we can verify whether both second and first order derivatives of two curve sections are similar at the intersection or not  that is:

(d p)/( d u) u=1  =   (d q) /(d v )v=0

And (d2 p)/( d u2) u=1  =   (d2 q) /(d v2 )v=0

Whether they are similar we can as we have C2 continuity   

 Note: as the same we can explain higher order parametric continuities


Related Discussions:- Important points about the curve segment

Determine how many key frames does one minute animation film, How many key ...

How many key frames does one minute animation film order along with no duplications need if there are five in among for each pair of key frames?   Solution : One minute = 60 sec

Subdivision algorithm - visible surface detection, Subdivision Algorithm - ...

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

Progressive scan in image capture formats, Progressive Scan: Progressive o...

Progressive Scan: Progressive or non-interlaced scanning is a process which displays, transmits or stores moving images wherein, the lines of all frame are drawn in order. It is i

Shading - polygon rendering and ray tracing methods, Shading - Polygon Rend...

Shading - Polygon Rendering and Ray Tracing Methods When one thing is under the exposure of light, so the rays of light are distributed over the surface and there the distribu

What is graphics, What is Graphics It is a term that refers to any com...

What is Graphics It is a term that refers to any computer device or program which makes a computer able of displaying and manipulating pictures. The name also refers to the im

What do you mean by emissive and non-emissive displays, What do you mean by...

What do you mean by emissive and non-emissive displays? EMISSIVE: The emissive display changes electrical energy into light energy. The plasma panels, thin film ele

Liang b arsky line clipping algorithm, Write the Liang B arsky line clippin...

Write the Liang B arsky line clipping algorithm. Why is Liang Barsky algorithm more efficient than the Cohen Sutherland algorithm?  Liang Barsky Line Clipping: Faster line cl

Explain shannon -fano algorithm, (a) Differentiate between the following co...

(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd