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
short note on shading

Ask question #Minimum how can we use stroke method method for character generation? 100 words accepted#

Different types of Simulating Motion - Computer Animation Here we discuss different ways of simulating motion as: a. Zero Acceleration or Constant Speed b. No

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

Approaches to Area Filling  Some other approaches to area filling are   Scan line polygon fill algorithm Boundary fill algorithm Flood fill algorithm.

Scan Line Polygon Fill Algorithm - Raster Graphics In such algorithm, the information for a solid body is stored in the frame buffer and utilizing that information each pixel

Subdivision Algorithm - Visible Surface Detection 1) Initialize the area to be the whole screen. 2) Create a PVPL regarding an area, sorted on z min as the smallest z coor

Illustration: Find the normalization transformation N that uses the rectangle W (1, 1), X (5, 3), Y (4, 5) and Z (0, 3) as a window and also the normalized device screen like the

Polygon or Area Clipping Algorithm - Sutherland-Hodgman Algorithm There are different algorithms as Liang-Barsky, Line clipping, Weiler-Atherton Polygon Clipping,

Sub Classes of Orthographic Projection There are three ordinary sub-classes of Orthographic (axonometric) projections as: 1) Isometric: The direction of projection makes