Polygon or area clipping algorithm, Computer Graphics

Assignment Help:

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm

There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping, which are fairly efficient in performing the job of clipping images. Although we will limit our discussion to the clipping algorithms declared previous.

Before going get any further details of point clipping, here we look at several basic terminologies utilized in the field of clipping, as viewport and window.

- Window may be explained as the world coordinate region selected for display.

-  Viewport may be explained as the region on a display device on that the window is mapped.

Consequently, it is the window that identifies what is to be displayed or shown whereas viewport identifies where it is to be shown or displayed.

Identifies these two coordinates:

Window and viewport coordinates and also the transformation from window to viewport coordinates are extremely necessary from the point of view of clipping.


Related Discussions:- Polygon or area clipping algorithm

Describe fully the term preflight, Question: Adobe InDesign software ...

Question: Adobe InDesign software is used to create works such as posters, flyers, brochures, magazines and books. Designers and graphics production artists are the principa

Explain the bresenham line generation algorithm, 1. Explain the Bresenham ...

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

Line drawing - points and lines, Line Drawing - Points and lines Line ...

Line Drawing - Points and lines Line drawing is accomplished through computing the intermediate point coordinates along the line path between two given end points. Since, scre

Constant intensity shading or flat shading, Constant intensity shading OR F...

Constant intensity shading OR Flat shading  In this technique particular intensity is calculated for each polygon surface that is all points that lie upon the surface of the

Determine the steps uses in cohen sutherland line clipping, Steps uses in t...

Steps uses in the Cohen Sutherland Line Clipping Algorithm are: Figure: Steps for Cohen Sutherland Line Clipping STEP 1: Input:  x L , x R , y T , y B

Ray casting - polygon rendering and ray tracing methods, Ray Casting -polyg...

Ray Casting -polygon rendering and ray tracing methods It is a method wherein the surfaces of objects visible to the camera are determined by throwing or say casting rays of

Three dimensional transformations, Three Dimensional Transformations A ...

Three Dimensional Transformations A 3D geometric transformation is used extensively in object modelling and rendering.2D transformations are naturally extended to 3D situations

Use of interactive multimedia in education, Use of Interactive Multimedia i...

Use of Interactive Multimedia in Education Virtual reality, where 3-D experimental training can simulate real situations. Computer simulations of things too expensive,

Find out the matrix of projection, Find out the matrix of projection for ca...

Find out the matrix of projection for cavalier projection Answer: Cavalier projection corresponds to tan α = 1, leading to the following matrix.

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