Test for checking disjoint polygons by using of min-max test, Computer Graphics

Assignment Help:

Test For checking Disjoint Polygons by using of Min-max Test

Test 1: For checking disjoint polygons by using of Min-max test.

Assume that you have two polygons as P1 and P2. The known polygons P1 and P2are disjoint if any of the subsequent four situations is satisfied as in the figures-11(a) and (b): These four tests are termed as Min-max test.

2416_Test For checking Disjoint Polygons by using of Min-max Test.png

Figure: (a)

2082_Test For checking Disjoint Polygons by using of Min-max Test 1.png

Figure: (b)

a). x⁽¹⁾_max < x⁽²⁾_min

b). x⁽²⁾_max < x⁽¹⁾_min

c). y⁽¹⁾_max < y⁽²⁾_min

d). y⁽²⁾_max < y⁽¹⁾_min

Related Discussions:- Test for checking disjoint polygons by using of min-max test

Handling mouse input, When you set up your project, create the class as an ...

When you set up your project, create the class as an "ACM Graphics Program", rather than a plain class. This will perform the necessary preparations for you to use mouse input in y

Polygon clipping - raster graphics and clipping, Polygon Clipping - Raster ...

Polygon Clipping - Raster Graphics and Clipping After considerate the idea of line clipping and its algorithms, we can currently extend the idea of line clipping to polygon cl

Area subdivision method for hidden surface removal, Q. Write a short note...

Q. Write a short note on area subdivision method for hidden surface removal. Ans. Area Subdivision This technique for hidden- surface removal is essentially an image- spac

Character generation - output primitives, Character Generation You know...

Character Generation You know that graphics displays often contain components which are text based. For example graph labels, annotations, descriptions on data flow diagrams,

Polygonal rendering, what is polygonal rendering

what is polygonal rendering

Bezier curves and surfaces - modeling and rendering, Bezier Curves and Surf...

Bezier Curves and Surfaces We had discussed in the previously that we can create complicated geometries along with the aid of polygon meshes that are further constituted of s

Character attributes, explain text attributes?

explain text attributes?

Approaches to area filling - output primitives, Approaches to Area Filling ...

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

Lamberts cosine law - diffuse reflection, Lamberts Cosine Law - Diffuse Ref...

Lamberts Cosine Law - Diffuse Reflection "LAMBERTS COSINE LAW" specify that the radiant energy from any minute surface area dA in any direction θ relative to the surface usual

Dda program to plot line segments, Use DDA algorithm to get the output of y...

Use DDA algorithm to get the output of your program as shown in Figure ANs: Use DDA( ) function to plot line segments that have end points on diametrically opposite points

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages