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

Character generation, What is character generation and explain it''s two me...

What is character generation and explain it''s two method: 1> Bitmap method 2> outline method.

Phong model or phong specular reflection model, Phong Model or Phong Specul...

Phong Model or Phong Specular Reflection Model It is an empirical model that is not based on physics, although physical observation. Phong observed here for extremely shiny su

Write short notes on active and passive transformations, Write short notes ...

Write short notes on active and passive transformations?  In the active transformation the points x and x| show different coordinates of the similar coordinate system. Here all

Ray tracing algorithm - recursive, Ray Tracing Algorithm - Recursive ...

Ray Tracing Algorithm - Recursive Frequently, the basic ray tracing algorithm is termed as a "recursive" acquiring an outcome wherein a given process repeats itself an arbitr

Scan conversion, what are the advertising effects of scan conversion

what are the advertising effects of scan conversion

Computer graphics, diffrence between vecgen and bresenham'' s algorithams

diffrence between vecgen and bresenham'' s algorithams

Boundary fill algorithm - output primitives, Boundary Fill Algorithm Bo...

Boundary Fill Algorithm Boundary fill algorithm is suitable when the boundary has single color while flood fill algorithm is more suitable for filling regions which are defined

Program to implement procedures or functions, The goal of this assignment i...

The goal of this assignment is to implement procedures/functions using x86 assembly. In addition to implementing procedures/functions, this assignment requires to pass arguments us

Dda, differentiate between dda and bresenhams line algorithm

differentiate between dda and bresenhams line 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