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

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.

Posted Date: 4/5/2013 1:26:03 AM | Location : United States







Related Discussions:- Cases for subdivisions of polygon-visible surface detection, Assignment Help, Ask Question on Cases for subdivisions of polygon-visible surface detection, Get Answer, Expert's Help, Cases for subdivisions of polygon-visible surface detection Discussions

Write discussion on Cases for subdivisions of polygon-visible surface detection
Your posts are moderated
Related Questions
Application Interlacing is utilized through all the analogue TV broadcast systems in recent use as: NTSC: 59.94 fields per second, 525 lines, still field drawn first

Define Computer graphics.  Computer graphics remains one of the most popular and rapidly growing computer fields. Computer graphics may be explained as a pictorial representati

Important points about the illumination Model An illumination model is also termed as lighting model and sometimes considered to as shading model, that is utilized to compute

Transformation for 3-D Scaling As we already seen that the scaling process is mainly utilized to change the size of an object. The scale factors find out whether the scaling i

Simulation: There are several things, places and events people cannot witness in first person. There are a lot of causes for this. Several may happen too rapidly, several may be t

Question: A curve shape has three quadratic Bézier curve segments. The curves have been joined sequentially so that continuity of the first derivative of the resulting curve sha

Area Filling Algorithms Before we go ahead with area filling algorithms, a word about pixel addressing and object geometry. You know that line segments are discretized into fin

Normal 0 false false false EN-US X-NONE X-NONE

IFF: It is Amiga Interchange File Format which is used to transfer documents to and from Commodore Amiga Computers. This format is really flexible and permits images and text to b

Stochastic Animation - Computer Animation This utilizes stochastic processes that are a stochastic process can be identified as a random function. Such randomness could be in