Subdivision algorithm - visible surface detection, Computer Graphics

Subdivision Algorithm - Visible Surface Detection

1) Initialize the area to be the whole screen.

2) Create a PVPL regarding an area, sorted on zmin as the smallest z coordinate of the polygon inside the area. Place the polygons in their suitable categories. Eliminate polygons hidden through a surrounding polygon and eliminate disjoint polygons.

3) Do the visibility decision tests as:

i) If the list is blank, set all pixels to the background color.

ii) If there is particularly one polygon in the list and this is classified as intersecting as in category 2 or contained as in category 3, colour by scan-converter the polygon and color the keeping area to the background color.

iii) If there is particularly one polygon on the list and that is a surrounding one, color the region the color of the surrounding polygon.

iv) If the region is the pixel (x,y), and neither a, b, nor c applies, estimate the z coordinate z(x, y) at pixel (x, y) of all polygons upon the potentially visible polygons list. The pixel is after that set to the color of the polygon along with the smallest z coordinate.

4) If none of the exceeding cases has occurred, subdivide the screen region into fourths.

Go to step 2, for each region.

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







Related Discussions:- Subdivision algorithm - visible surface detection, Assignment Help, Ask Question on Subdivision algorithm - visible surface detection, Get Answer, Expert's Help, Subdivision algorithm - visible surface detection Discussions

Write discussion on Subdivision algorithm - visible surface detection
Your posts are moderated
Related Questions
Chemistry: Computer animation is a very helpful tool in chemistry. Several things in chemistry are too small to see, and handle or do experiments on like, molecules and atoms for

Combination of Positive and Negative Accelerations Actually, it is not that a body once decelerated or accelerated will remain so, although the motion may include both speed-up

Cases for Digital Differential Analyzer Algorithm 1)  If in case 1, we plot the line another way round that is, moving in y direction via 1 unit every time and after that hunt

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

Problem: (a) List four components of ‘Multimedia'. (b) Write short notes on the following: (i) itunes (ii) ipods (c) Some Multimedia development teams can have an

There are mostly two kinds of Video Tele Conference systems: 1) Desktop systems are add-ons to normal PC's, transforming them in Video Tele Conference devices. A range of variou

Write a program that allows interactive manipulation of the position and orientation of a camera. Draw a teapot at the global origin 0,0,0. You can find a shaded teapot model and

Geometrical examine Types of Line Clipping Geometrical examine of the above kinds of clipping (it assists to get point of intersection of line PQ along with any edge). Assu

Define pixel and frame buffer? Pixel is shortened forms of picture element. Every screen point is referred to as pixel or pel.  Picture definition is kept in a memory area c

Panning and zooming Components (such as your Polybounce or Animation) is simply a matter of reFrameing the world window. To pan right or left horizontally, one shifts it in the pos