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

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

Posted Date: 4/5/2013 1:28:27 AM | Location : United States







Related Discussions:- Test for checking disjoint polygons by using of min-max test, Assignment Help, Ask Question on Test for checking disjoint polygons by using of min-max test, Get Answer, Expert's Help, Test for checking disjoint polygons by using of min-max test Discussions

Write discussion on Test for checking disjoint polygons by using of min-max test
Your posts are moderated
Related Questions
State the Areas of use of data goggles Entertainment   Used in television/films as special effects (for example "holodeck" in Star Trek: The Next Generation and Brazilian

Importance of Multimedia: Multimedia will help in spreading the information age to millions of teachers/learners. Today Multimedia educational computing is fastest raising markets

Surface of Revolution - Modeling and Rendering In the previsions sections we have learned different type of techniques of generating curves, although if we wish to generate a

Axis of Rotation - Construction of a solid with a translational sweep Figure:  (a)                                                                          Figure  (b)

In this lab you will learn how to use chrominance1 to segment coloured images. Here you be detecting skin, however, you could use this method to detect other coloured regions in im

determine the tranformation matrix for reflection,computer graphics

Cohen Sutherland algorithm Point clipping is very simple.  All you need to check is whether a point is inside the window extremes in x- and y-directions.  For line clipping sev

QUESTION 1. You are a consultant in the field of video production and video editing. You haven been requested to participate in a debate over analog and digital video. Write

Ellipse generating algorithm: Algorithm is similar to circle algorithm. We divide the ellipse on the positive quadrant into two regions. Region 1 where the slope > -1, and Reg

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