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.
Distinguish between uniform scaling and differential scaling? When the scaling factors sx and sy are assigned to the similar value, a uniform scaling is produced that maintain
Image Capture Formats: Video cameras appear in two various image capture formats: progressive and interlaced scan. Interlaced Scan It is a technique of enhancing the
Categorization of Light resources - Point source This is the easiest model for a light emitter. Currently rays from source obey radically diverging ways from the source positi
I need different convincing virtual environments (2D and 3D) that alter size perception. In particular, for 2D environment or background, when any object is augmented with the 2D e
(a) Differentiate between the following compression algorithm: 1. Shannon -Fano Algorithm and 2. Huffman Encoding (b) A statistical encoding algorithm is being considered
Explain Bresenham s circle drawing algorithm, OR Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm 1. Input radius r and circle
What are the advantages of Bresenham's line drawing algorithm over DDA line drawing algorithm? DDA and Bresenham algorithms both are efficient line drawing algorithm. Breaenham
Computations with Phong Shading Computations involved along with Phong Shading: i) Find out average unit normal vector at each polygon vertex. ii) Linearly interpol
1. Explain the Bresenham line generation algorithm via digitizing the line with end points as (15, 5) and also (25,13). Ans. Now we are utilizing the Bresenham line generati
Polygon Surfaces - Curves and Surfaces By Figure 1 and Figure 2 it is clear that it is possible to store description of objects as a set of surface polygons and similar i
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