2-d viewing and clipping - raster graphics and clipping, Computer Graphics

Assignment Help:

2-D Viewing and Clipping - Raster Graphics and  Clipping

In the previous two units of this block, we illustrated the basic elements of computer graphics, that is, the hardware and the software utilized for graphic systems with the graphic primitives utilized to create graphic images. Here, we are in a position to discuss technicalities concerned to the display of any graphic image or primitive. So let us start with, the idea of clipping for both line and point clipping, followed via the concerned algorithms utilized to perform line clipping. We shall subsequently examine the idea and algorithm associated to polygon clipping and end with a discussion on window to viewport transformations.

Clipping may be explained as the procedure which considers the portions of a picture lie within the region, and thus, it should be shown or outside the particular region, and therefore, not to be drawn. The algorithms which perform the task of clipping are termed as clipping algorithms there are different types, as:

  • Polygon Clipping
  • Curve Clipping
  • Point Clipping
  • Line Clipping
  • Text Clipping

 

Additionally, there are a broad variety of algorithms which are designed to do specific types of clipping operations, several of them that will be discussed in section.

Line Clipping Algorithms:

  • Cohen Sutherland Line Clippings
  • Cyrus-Beck Line Clipping Algorithm

Related Discussions:- 2-d viewing and clipping - raster graphics and clipping

Drawing, how can I draw a flower.

how can I draw a flower.

Understanding the concept of hypertext and hypermedia, Understanding the Co...

Understanding the Concept of hypertext and hypermedia: For know the principle of Hypertext and Hypermedia we will look at how the human memory works.

Modify the dda algorithm for negative sloped lines, 1. Modify the DDA algo...

1. Modify the DDA algorithm for negative sloped lines; discuss both the cases i.e., slope > 1 and 0   Ans. For the generation of lines along with negative slopes as:

What colour depths are basically used, Q. What Colour depths are basically ...

Q. What Colour depths are basically used? Basically the number of colours are an exponential power of 2 as for Colour Depth n, colours can be showed. The most popular colour mo

Gourand shading or intensity interpolation scheme, Gourand shading OR Inten...

Gourand shading OR Intensity interpolation scheme Now there polygon is rendered through linearly interpolating intensity values across the surface. Intensity values for all po

#title., WHAT IS PAINTERS ALGORITHM?

WHAT IS PAINTERS ALGORITHM?

Define addressability, What is meant by Addressability?  The Addressabi...

What is meant by Addressability?  The Addressability is the number of individual dots per inch (d.p.i) that can be formed. If the address of the current dot is (x, y) then the

Viewing transformation, Viewing Transformation In previous section, we...

Viewing Transformation In previous section, we have discussed about the geometric transformations as Translation, Shearing, Reflection, Scaling and Rotation. Rotation, Reflect

Advantages of the z-buffer method, Advantages of the z-buffer method:      ...

Advantages of the z-buffer method:              1) The z-buffer method or algorithm is easy to apply and it needs no sorting of surface in a scene. 2) In z-buffer algorithm

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

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!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd