Assumptions for area subdivision method, Computer Graphics

Assignment Help:

Assumptions for Area Subdivision Method

a) ¾   Plane of projection is z=0 plane

b) ¾ Orthographic parallel projections

c) ¾   Direction of projection as d= (0,0,-1)

d) ¾   suppose here, the viewing (screen) area is a square

e) ¾   Objects are made up of polygon faces.

1817_Assumptions for area subdivision method.png

To apply the area-subdivision method, we should identify whether the area is part of a single surface or a complex surface by means of visibility tests. If the tests specify that the view is sufficiently complicated, we subdivide it. Furthermore, we apply the tests to each of the smaller regions and then subdivide additionally, whether the tests specify that, the visibility of a particular surface is still not certain. We continue this process till the subdivisions are simply analyzed as belonging to a particular surface or till they are decreased to the size of a single pixel. Beginning with the full screen as the initial area, the algorithm divides an area at all stages in four smaller area, as demonstrated in figure 8 that is similar to quad-tree approach.


Related Discussions:- Assumptions for area subdivision method

Positive accelerations - computer animation, Positive Accelerations - Compu...

Positive Accelerations - Computer Animation So as to incorporate increasing speed in an animation the time spacing among the frames should increase, hence greater change in th

What is a model sheet?, Question 1 Briefly explain the twelve principles o...

Question 1 Briefly explain the twelve principles of animation Question 2 Explain the methods to set-up pre and post-infinity curves Question 3 What is a model sheet? Exp

2-d and 3-d transformations, 2-D and 3-D Transformations Previously, w...

2-D and 3-D Transformations Previously, we have presented approaches for the generation of polygonal regions and lines. We identified that once the objects are produced, the v

Do we have need of to generate full circumference of circle, 1.   Do we hav...

1.   Do we have need of to generate the full circumference of the circle utilizing the algorithm or  can we can produces it in a quadrant or octant only and after that utilization

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Assumptions for polygon or area clipping algorithm, Assumptions for Polygon...

Assumptions for Polygon or Area Clipping Algorithm Assumption: The viewport and window are rectangular. So only, by identifying the maximum and the minimum coordinates t

Texturing - texture coordinate, Background Texturing is like wallpaperin...

Background Texturing is like wallpapering; you are pasting an image onto the OpenGL Quad primitive.  Recall that GL_QUAD is specified by four vertices.  An image, or a texture,

Polygon filling algorithm - raster graphics and clipping, Polygon Filling A...

Polygon Filling Algorithm - Raster Graphics and Clipping In several graphics displays, this becomes essential to differentiate between different regions by filling them along

Objectives-visible-surface detection, After going through this section, you...

After going through this section, you should be capable to: know the meaning of Visible-surface detection; distinguish among image-space and object-space approach for vi

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd