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

Types of refresh monitors - raster scan and random scan, Types of Refresh M...

Types of Refresh Monitors - Raster Scan and Random Scan There are two types of refresh monitors, i.e. the Raster Scan and Random Scan that will be illustrated separately.

Determine how many key frames does one minute animation film, How many key ...

How many key frames does one minute animation film order along with no duplications need if there are five in among for each pair of key frames?   Solution : One minute = 60 sec

Disadvantages of analogue signal over digital signal, Problem: (a) Lis...

Problem: (a) List four components of ‘Multimedia'. (b) Write short notes on the following: (i) itunes (ii) ipods (c) Some Multimedia development teams can have an

Computer animation tools, Computer Animation Tools  To create various t...

Computer Animation Tools  To create various types of animation discussed above, we want to have particular software and hardware as well. Here, the fundamental constraint is re

Types of light resources - illumination model, Types of Light Resources - i...

Types of Light Resources - illumination Model Let us discuss about the types of light resources. The light sources can not merely be natural like light from Sun or Moon or Sta

Cases of the sutherland hodgman polygon clipping algorithm, Cases of the Su...

Cases of the Sutherland Hodgman Polygon Clipping Algorithm In order to clip polygon edges against a window edge we move from vertex V i to the subsequent vertexV i+1 and cho

Windowing transformations - raster graphics and clipping, Windowing Transf...

Windowing Transformations - Raster Graphics and  Clipping From the above section of introduction, we understood the meaning of the viewport and term window that could again be

Applications that can handle bitmap data, Applications that can handle Bitm...

Applications that can handle Bitmap Data Hundreds of applications are there in the market which can be used to modify or make bitmap data. For illustration: Adobe Photo Shop, C

Scan conversion of line with the slope, Scan Conversion of Line with the sl...

Scan Conversion of Line with the slope (0 Currently the pixel positions beside the line path are determined through sampling at Unit x intervals that is, starting from the fi

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