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(1)max < x(2)min

b). x(2)max < x(1)min

c). y(1)max < y(2)min

d). y(2)max < y(1)min


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

Improving gif compression, Improving GIF Compression: Features of LZW comp...

Improving GIF Compression: Features of LZW compression can be used to enhance its efficiency and thereby decrease the size of your graphic interchange format graphics. The strateg

Basics of animation - computer animation, Basics of Animation - Computer an...

Basics of Animation - Computer animation Historical and traditional methods for production of animation: As we have studied the transformations linked in computer graphics

Dtp, pagemaker is a image editor

pagemaker is a image editor

Reflection, Determine the transformation matrix for the reflection, Compute...

Determine the transformation matrix for the reflection, Computer Graphics

Determine the term- virtual reality, Determine the term- Virtual Reality ...

Determine the term- Virtual Reality Virtual Reality (VR) This is an artificial 3D environment which is created by a computer system. Very often user wears data helmet, d

Advantages of scan line algorithm, Advantages of Scan line Algorithm:  ...

Advantages of Scan line Algorithm:   This time and always we are working along with one-dimensional array as: x[0...x_max] for color not a 2D-array like in Z-buffer algorithm.

Proof of subsequent properties of bezier curves, Proof of subsequent proper...

Proof of subsequent properties of Bezier curves Note: Proof of subsequent properties of Bezier curves is left as a work out for the students P' (0) = n (p 1 - p 0 ) P

Explain the role of the prefight personnel, QUESTION a) Once a print jo...

QUESTION a) Once a print job is accepted by the print service provider, it will be assigned a job number and this information will become part of a printed job ticket, which wi

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