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

C++ programming, self test exercise 17 asked you to overload the operator >...

self test exercise 17 asked you to overload the operator >> and the operator Overload biinary operator + to add pairs according to the rule (a, b) + (c, d) = (a + c, b, + d) overl

Object space - approaches for visible surface determination, Object Space -...

Object Space - approaches for visible surface determination The second approach as object-space that compares all objects directly along with each other inside the scene defin

What makes a pattern a pattern, QUESTION (a) Suppose that you have been...

QUESTION (a) Suppose that you have been assigned to re-engineer the existing systems for a company. Do you think that design patterns can be applied to these existing systems?

De casteljeau algorithm - bezier curves, De Casteljeau algorithm: The cont...

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

What are the important properties of bezier curve, What are the important p...

What are the important properties of Bezier Curve?  It requires only four control points It always passes by the first and last control points The curve lies enti

Character generation, Ask question #Minimum how can we use stroke method me...

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

Polygon or area clipping algorithm, Polygon or Area Clipping Algorithm - Su...

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

What is resolution, What is resolution? Ans. The maximum number of poin...

What is resolution? Ans. The maximum number of points that can be shown without an overlap on a CRT is known as resolution.

Finding where the ball hits a segment, You will write a two-dimensional pre...

You will write a two-dimensional precursor of the three-dimensional bouncing ball simulation that is one of your choices for a ?nal project. This involves adding functions to your

Character Generation, Explain Various techniques of Character Generation Al...

Explain Various techniques of Character Generation Algorithm?

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