Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
2D Line Segment Generation
A digitally plotted line is basically an approximation of infinite number of points on an abstract line segment by only a finite number of points on a computer display. This is needed because the display devices can only plot a finite number of points, however large the resolution of the device may be. So, the key concept of any line drawing algorithm is to provide an efficient way of mapping a continuous abstract line into a discrete plane of computer display.
This process is called rasterization or scan conversion. These algorithms basically approximate a real valued line by calculating pixel coordinates to provide an illusion of line segment. Since the pixels are sufficiently small, the approximation gives a good illusion of a continuous line segment to the human eyes. To understand what is meant by rasterization, we plot a line segment on a pixel grid as shown in Fig (a). The segment points are scan converted and approximated by a single shaded pixel as shown in Fig (b). Here we have shown a pixel by a square, but you know that a pixel actually has a disc shape with the boundary marked as the visible portion of the dot formed by the striking electron gun. The pixel shown here is the bounding rectangle of that dot.
What is the need of homogeneous coordinates? To perform more than one transformation at a time, use homogeneous coordinates or matrixes. They decrease unwanted calculations in
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
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
Ray Tracing: Ray t racing is the technique to determine which objects in the scene are visible. In this to identify the visible surface for each pixel we continue to bounce the
Transformation for parallel projection Parallel projections is also termed as Orthographic projection, are projections into one of the coordinate planes as x = 0, y = 0 or z
De Casteljau Algorithm For computation of Bézier curves an iterative algorithm known as de Casteljau algorithm is used. The algorithm uses repeated linear interpolation.
Rotation - 2-D and 3-D transformations Within 2-D rotation, an object is rotated via an angle θ along w.r.t. the origin. This angle is assumed to be +ive for anticlockwise rot
what is shearing transformation?
Variation of Intensity - Modeling and Rendering According to the phong model the variation of Intensity (I) along with α (since I α cos n α) is: i) for shiny surface (
Scientific Visualization This is complex for the human brain to create sense out of the large volume of numbers produced through a scientific computation. Statistical and nume
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd