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
Explanation of light source by a luminance Explanation of any light source by a luminance the factors identified as: Light source explained by a luminance 1)   All color as

1. By using Digital Differential Analyzer algorithm draw line segments from point (1,1) to (9,7). Ans. We see that the usual equation of the line is specified by: y = mx+c

QUESTION You are employed as a graphics designer in an advertising agency and recently completed a brochure artwork for a client. You need to send the file for printing before

Explain rubber-band interactive picture technique

What is persistence and resolution?  The time it takes the emitted light from the screen to decay one tenth of its original intensity is known as a persistence.  The maximum


In this project, the image data set consists of 320 training images and 285 test images. Table 1 shows the image data set in details. In addition to the original images, th

Question 1 Describe the process of formation of image in human eye Structure of the Human Eye Image formation in the Eye Brightness Adaptation and Discrimination

DDA or Digital Differential Analyzer Algorithm - Line generation algorithms From the above discussion we get that a Line drawing is accomplished through calculating intermedi