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
Trivial Rejection Case of cohen sutherland line clippings Case: it  is Trivial Rejection Case; if the logical intersection (AND) of the bit codes of the end points P, Q of

QUESTION (a) What are the main purposes of using master pages? (b) How do you select a master page item on a document page? (c) How do you resize a graphics frame and its

Reflection about a Line - 2-D and 3-D Transformations Reflection is a transformation that produces the mirror image of an object. Since we discussed that the mirror reflection

1. Design a bitmap for the English vowels A, E, I, O, U for two different sizes and then implement the bitmaps to plot these vowels on the display. Keep in mind that baseline of al

Sketch Line Segment That Joining By Using Bresenham Line Algorithm Example: Sketch line segment that joining (20, 10) and (25, 14) by using Bresenham line generation algorit

3Dstudio - Softwares for computer animation 3DStudio is a 3-D computer graphics programmed. 3DStudio runs on personal computers. This is relatively simple to use. Several schoo

Question : You have been approached to design a ‘tuck top auto-lock bottom' carton package for a high-end cosmetic jar under the brand name ‘Beauty One'. Your client asked you

Explain Bresenham s circle drawing algorithm,  OR   Explain midpoint circle algorithm for scan converting a circle. Midpoint Circle Algorithm   1. Input radius r and circle


Web-based Services: Commonly utilized software is: Protected Area Archive characteristics: Image display, roam, zoom and Image enhancement. Simple image processing.