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

Polygon -rendering methods, Polygon -Rendering Methods Now we will see...

Polygon -Rendering Methods Now we will see the application of an illumination model to execute the rendering of standard graphics objects that are formed along with polygonal

Z- buffer algorithm, Q.   Describe the z- Buffer algorithm for hidden surfa...

Q.   Describe the z- Buffer algorithm for hidden surface removal. Ans. Z- buffer method: This method compares surface depths at each pixel position on the projection plane. T

Clip a line segment - cyrus beck line clipping algorithm, How does the Cyru...

How does the Cyrus Beck line clipping algorithm, clip a line segment whether the window is non convex? Solution : see the following figure 13, now the window is non-convex in s

Scan line algorithm - output primitives, Scan Line Algorithm A scan lin...

Scan Line Algorithm A scan line algorithm determines the overlap intervals of the polygon with each scan line to obtain interior points of the polygon for assigning those point

Briefly describe what you understand by smoothing, Question: (a) List a...

Question: (a) List and explain different types of lights that can be used in After Effects. (b) How is the density of dots between the boxes in a motion path related to th

Cohen sutherland line clippings algorithm, Cohen Sutherland Line Clippings ...

Cohen Sutherland Line Clippings Algorithm The clipping problem is identified by dividing the region surrounding the window area into four segments Up as U, Down as D, Left as

What do you understand by complementary colors, Problem : a. (i) Giv...

Problem : a. (i) Give another name for adjacent color. (ii) Describe briefly what do you understand by an adjacent color? b. (i) Describe briefly what do you unders

Which main components are needed for computer graphics, Can you tell which ...

Can you tell which main components (hardware and software) are needed for computer graphics? Besides the computer, some special devices and software may be needed especially fo

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