Cases for subdivisions of polygon-visible surface detection, Computer Graphics

Assignment Help:

Cases for Subdivisions of Polygon

No additional subdivisions of a particular area are desired, if one of the subsequent conditions is true as:

Case 1: All the polygons are disjoint from the region. In this condition, the background color can be displayed in the region.

Case 2: Accurately one polygon faces, after projection, comprised or intersecting in the square region. In this condition the area is first filled along with the background color, and after that the part of the polygon comprised in the region is scan converted.

Case 3: There is a particular surrounding polygon, although no intersecting or comprised polygons. In this condition the region is filled along with the color of the surrounding polygon.

Case 4: More than one polygon is contained in surrounding the area, although one is a surrounding polygon which is in front of all another polygon. Finding whether a surrounding polygon is in front is done through computing the z coordinates of the planes of all surrounding, contained and intersecting polygons at the four corners of the area; if there is a surrounding polygon that four corner z coordinates are larger than one that of any other polygons so the entire region can be filled along with the color of this surrounding polygon.


Related Discussions:- Cases for subdivisions of polygon-visible surface detection

Explain briefly ancillary operations, Problem: a. Explain briefly six A...

Problem: a. Explain briefly six Ancillary Operations? b. When do ancillary operations take place? c. (i) What is flexography? (ii) Provide examples of finished produ

Isosurface, Given arbitrary 8 values at the vertices of a cube, please draw...

Given arbitrary 8 values at the vertices of a cube, please draw the curved iso-surfaces with shading. Also, please draw the saddle point. This can be done relatively easy with phys

Test for checking disjoint polygons by using of min-max test, Test For chec...

Test For checking Disjoint Polygons by using of Min-max Test Test 1: For checking disjoint polygons by using of Min-max test. Assume that you have two polygons as P1 and

Assignemt, i need help in my Engineering graphic assignment

i need help in my Engineering graphic assignment

Scan line polygon fill algorithm - raster graphics, Scan Line Polygon Fill ...

Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

De Casteljeau algorithm: The control points P 0 , P 1 , P 2 and P 3 are combined with line segments termed as 'control polygon', even if they are not actually a polygon although

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

Adobe premiere - softwares for computer animation, Adobe Premiere - Softwar...

Adobe Premiere - Softwares for computer animation It just like the name as is generated by Adobe. This is a tool used to composite digitized video, stills and applies a variet

Prepare a cylinder, Question: (a) Write a short note on the dot syntax...

Question: (a) Write a short note on the dot syntax as used in actionScript. (b) A data type describes the kind of information a variable or ActionScript element can hold.

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