Breaking

शनिवार, 25 अप्रैल 2020

BCA 4th Sem Notes -Cubic Curves

  • UNIT-I 
~The Advantages of Interactive Graphics
~Representative Uses of Computer Graphics 
~Classification of Application Development of Hardware and software for computer Graphics
~Overview, Scan:
~Converting Lines
~Scan Converting Circles
~Scan Converting Ellipses







  • UNIT-II 
  • ~Hardcopy Technologies
    ~Display Technologies
    ~Raster-Scan Display System
    ~Video Controller
    ~Random-Scan Display processor
    ~Input Devices for Operator Interaction
    ~Image Scanners
    ~Working exposure on graphics tools like Dream Weaver, 3D Effects etc
    ~Clipping
    ~Southland- Cohen Algorithm
    ~Cyrus-Beck Algorithm
    ~Midpoint Subdivision Algorithm








  • UNIT-III 
  • ~Geometrical Transformation
    ~2D Transformation
    ~Homogeneous Coordinates and Matrix Representation of 2DTransformations 
    ~composition of 2D Transformations
    ~The Window-to-Viewport
    Transformations






  • UNIT-V                           

  • ~Multimedia Definition
    ~CD-ROM and the multimedia highway
    ~Computer Animation
    (Design, types of animation, using different functions)






  • UNIT-VI  

  • ~Uses of Multimedia
    ~Introduction to making multimedia –
    ~The stage of Project
    ~hardware & software requirements to make good multimedia skills
    ~Training opportunities in Multimedia Motivation for Multimedia usage

    Cubic Curves

    a cubic curve can be uniquely defined by giving 4 points. It would seem in our best interest to somehow specify those 4 points and have the curve pass through them. We can do this, because a cubic equation has 4 unknowns (our ci-s). If we specify 4 constraints, we can find those currently unknown coefficients and thus make g(t) actually usable.
    If we want a cubic curve to pass through all 4 points (called control points), we can specify the constraints:
    g(0)=c0+c10+c20+c30=p0
    g(13)=c0+c113+c2(13)2+c3(13)3=p1
    g(23)=c0+c123+c2(23)2+c3(23)3=p2
    g(1)=c0+c11+c21+c31=p3
    The control points pi are called parameters, so a vector p would be a parameter vector.
    We can write this system of equations as a matrix-vector operation.
    Cc=p
    We call the matrix C a constraint matrix.
    C=(1000113(13)2(13)3123(23)2(23)31111)
    There is also the coefficient vector c. Those are the unknowns.
    c=(c0c1c2c3)
    And finally a parameter vector p.
    p=(p0p1p2p3)
    Given this system we can find the solution to c by taking the inverse of C and multiplying from the left.
    Cc=p
    C1Cc=C1p
    c=C1p
    The matrix C1 is called a basis matrix and is usually denoted B. This would give us the coefficients that satisfy the equations. We can multiply this equation once more with another vector to get the actual curve equation that we can use. The elements of our new vector tvec depend on our argument value t.
    tvec=(1tt2t3)
    tvecc=tvecBp
    Notice that tvecc is exactly our initial curve function. 
    g(t)=tvecBp
    The product tvecB gives us another vector b that has scalar functions as elements. When we multiply it with the parameter vector p we will get a sum of the products of corresponding elements of b and p. So each element of p is taken into account, or blended, by a scalar coefficient from b. That is why the elements of b are usually called blending functions. They are functions, because they depend on our argument t. Sometimes our curve function is thus written out as:
    g(t)=i=0nbi(t)pi,
    where bi(t) is the i-th element of b, a function of t.


    कोई टिप्पणी नहीं:

    एक टिप्पणी भेजें