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.
Magnify a triangle with vertices A = (1,1), B = (3,1) and C = (2,2) to twice its size in such a way that A remains in its original position. Answer: You need to apply scaling b
what is physx?
What is Polygon mesh? Polygon mesh is a method to show the polygon, when the object surfaces are tiled, it is more convenient to state the surface facets with a mesh function.
Algorithms for Basic Line Segment Plotting There are two important algorithms for basic line segment plotting-DDA algorithm and Bresenham algorithm. Both the algorithms use th
Algorithms for filled-area primitives These algorithms are classified into two categories (i) Scan line algorithms (ii) Seed fill algorithms.
List out the merits and demerits of DVST? The merits and demerits of direct view storage tubes [DVST] are as follows It has a flat screen Refreshing of screen is
A convex polygonal region having n- vertices {P 0 , P 1 , P 2 ..., P n - 1 , P n , P 0 } or lattice points to be identified by the user includes the convex window area. To be exact
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
Algorithm (scan-line): For each scan line perform from step (1) to (3). 1) For all pixels on a scan-line, arrange depth [x]=1.0 i.e. max value and Intensity [x] = background
Alias Wavefront - Softwares for Computer Animation Alias is one of the highest computer animation packages out there. Alias was formed by the company which used to be Alias, a
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