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
Multimedia Tool Features General to nearly all multimedia tool platforms are various features for encapsulating the content, presenting the data, acquiring user input and cont

Specified p 0 (1, 1): p 1 (2, 3); p 2 (4, 3); p 3 (3, 1) as vertices of Bezier curve find out 3 points on Bezier curve? Solution : We consider Cubic Bezier curve as: P (

Rotation about z-axis - Transformation for 3-d rotation Rotation about z-axis is explained by the xy-plane. Suppose a 3-D point P(x,y,z) be rotated to P'(x',y',z') along with

3-D Transformation The capability to represent or display a three-dimensional object is basically to the knowing of the shape of that object. Moreover, the capability to rotat

Question 1 Explain the fundamental steps in digital image processing 2 Explain the terms reflection, complement and Translation with example diagrams 3 Explain about Imag

Definitions of Hypertext A manner of presenting information online along with links among one piece of information and the other. These links are termed as hypertext links

Explain Various techniques of Character Generation Algorithm?

Question: (a) Describe the term ‘Multimedia'. (b) Briefly describe two main reasons to use ‘Compression' in Multimedia. (c) All Multimedia development teams could have

The description and measurement of circadian rhythms. Describe the standard method used for the recording and graphing of behavioral rhythms in animals, especially the use

How many 128 x 8 RAM chips are needed to provide a memory capacity of 4096 16 bits?