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

Briefly explain modes and switches, Question 1 Write a note on: Audio Spec...

Question 1 Write a note on: Audio Spectrum & Audio Waveform Question 2 What is high dynamic range color? Explain gradient color Question 3 Describe Time-Remapping

Modal create, morgen wants to sign up for an account on doggobook, the worl...

morgen wants to sign up for an account on doggobook, the world''s thrid - best social network for dog enthusiasts. she enters her email address and a password into the sign-up form

3-d modeling and animation tools, 3-D Modeling and Animation Tools: By 3-D...

3-D Modeling and Animation Tools: By 3-D modeling software, objects rendered in perspective show more realistic. One can produce stunning scenes and wander by them, choosing just

Mpeg-1, MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is a...

MPEG-1 : MPEG-1 that is Moving Picture Experts Group format 1 is an industry standard encoding format that is broadly used. Its normal format is a frame size of about 352 x 240 an

How many key frames does a one-minute animation film, How many key frames d...

How many key frames does a one-minute animation film order along with no duplications need? Solution : One minute = 60 seconds Number of frames needed per second=24 Numbe

Limitations of cohen sutherland line clipping algorithm, Limitations of Coh...

Limitations of Cohen Sutherland line clipping Algorithm The algorithm is merely applicable to rectangular windows and not to the other convex shaped window. Consequently, a

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

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