This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Angel: Interactive Computer Graphics, Fifth Edition Chapter 7 Solutions 7.1 First, consider the problem in two dimensions. We are looking for an and such that both parametric equations yield the same point, that is x ( ) = (1 ) x 1 + x 2 = (1 ) x 3 + x 4 , y ( ) = (1 ) y 1 + y 2 = (1 ) y 3 + y 4 . These are two equations in the two unknowns and and, as long as the line segments are not parallel (a condition that will lead to a division by zero), we can solve for . If both these values are between 0 and 1, the segments intersect. If the equations are in 3D, we can solve two of them for the and where x and y meet. If when we use these values of the parameters in the two equations for z , the segments intersect if we get the same z from both equations. 7.3 If we clip a convex region against a convex region, we produce the intersection of the two regions, that is the set of all points in both regions, which is a convex set and describes a convex region. To see this, consider any two points in the intersection. The line segment connecting them must be in both sets and therefore the intersection is convex. 7.5 See Problem 6.22. Nonuniform scaling will not preserve the angle between the normal and other vectors. 7.7 Note that we could use OpenGL to, produce a hidden line removed image by using the z buffer and drawing polygons with edges and interiors the same color as the background. But of course, this method was notthe same color as the background....
View
Full
Document
This note was uploaded on 01/25/2011 for the course CSCI 6821 taught by Professor Alxe during the Spring '10 term at Georgia Southwestern.
 Spring '10
 Alxe
 Computer Graphics

Click to edit the document details