High level techniques (motion generalized), Computer Graphics

High level techniques (motion generalized)

Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to produce a motion by using a set of rules or constraints. The animator sets-up the rules of the model, or selects a suitable algorithm, and chooses initial values or boundary values. The system is after that set in motion and the motion of the objects is controlled through the model or algorithm; such approaches frequently rely on quite sophisticated computation as vector algebra and numerical methods and others.

Isn't it amazing that the Computer animation has been around as extended as computer graphics that is used to generate realistic elements that are intermixed along with the live action to create animation? The traditional way of animation is building basis of the computer generated animation systems and is widely utilized now days via different companies as, Disney, MGM, Warner Bros, and so on, to generate realistic 3-D animation by using different animation tools. Various tools are available for diverse use. Hence, the basic problem is to choose or design animation tools that are expressive adequate for the animator to specify what he/she wants to identify whereas at very similar time are powerful or automatic enough for the animator doesn't have to identify the details that she/he is not interested in. Clearly, there is no particular tool which is going to be right for every animator, for each animation or even for each scene in a particular animation.

The suitability of a particular animation tool depends upon the consequence desired through the animator. An artistic part of animation will probably need various tools for an animation proposed to simulate reality. Some illustrations of the latest animation tools accessible in the market are Digimation, Alias/Wavefront (SGI), Lightwave 3-D (Newtek), 3-D studia MAX (Autodesk), Softimage (Microsoft), Prism 3-D Animation Software (Side Effects Software), HOUDINI (Side Effects Software), Apple's Toolkit for game developers.

After consisting some breifings regarding the overall topic of animation, here let us finds out its details. Initially we define/explain computer animation that is a time-based phenomenon which covers any change of appearance or any visual consequence regarding the time domain that includes motion that is positional change as translation or rotation, time-varying changes in shape, colour or palette, transparency and even modifies of the rendering method.

Posted Date: 4/5/2013 5:27:39 AM | Location : United States

Related Discussions:- High level techniques (motion generalized), Assignment Help, Ask Question on High level techniques (motion generalized), Get Answer, Expert's Help, High level techniques (motion generalized) Discussions

Write discussion on High level techniques (motion generalized)
Your posts are moderated
Related Questions
Determine the transformation matrix for: a) Cavalier projection with θ=45 0 , and b) Cabinet projection with θ=30 0    c) Draw the projection of unit cube for all transfor

Line Generation Algorithms - Graphic Primitives In previous section we have discussed the case of frame buffer, here information regarding the image to be projected upon the

Achieve a perspective projection on the z = 0 plane of the unit cube, demonstrated in Figure (l) from the cop at E (0, 0, 10) upon the z-axis. Figure: I 01:  currently c

High level techniques (motion generalized) Techniques utilized to explain general motion behavior of any of graphic object, such techniques are algorithms or models utilized to

What are the Developments of CAD Now CAD packages can be linked to 3D ink jet printers which produce an actual prototype model by building up layers/slices in fine powder (suc

A 2D geometric shape is rotated about a point with coordinates (1,2)  by 90°  in a clockwise direction.  Then, the shape is scaled about the same point in the x-coordinate by 2 tim

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

What are the utilizations of Inverse transformation? Provide the Inverse transformation for translation, shearing, reflection, scaling and rotation. Solution: We have observed

when dda algorithm is more efficient than bresenhem line drawing algorithm