• Home
  • Textbooks
  • Computer Graphics with Open GL
  • Three-Dimensional Viewing

Computer Graphics with Open GL

Donald Hearn. M. Pauline. Baker, Warren R.Carithers

Chapter 9

Three-Dimensional Viewing - all with Video Answers

Educators


Chapter Questions

01:14

Problem 1

Write a procedure to set up the matrix that transforms world-coordinate positions to threedimensional viewing coordinates, given $P_{0}, N$, and V. The view-up vector can be in any direction that is not parallel to $\mathbf{N}$.

Adriano Chikande
Adriano Chikande
Numerade Educator
01:14

Problem 2

Write a procedure to transform the vertices of a polyhedron to projection coordinates using a parallel projection with any specified projection vector.

Adriano Chikande
Adriano Chikande
Numerade Educator
00:48

Problem 3

Write a program to obtain different parallelprojection views of a polyhedron by allowing the user to rotate the polyhedron via the keyboard.

Allison Knapp
Allison Knapp
Numerade Educator
02:18

Problem 4

Write a procedure to perform a one-point perspective projection of an object.

Foster Wisusik
Foster Wisusik
Numerade Educator
01:18

Problem 5

Write a procedure to perform a two-point perspective projection of an object.

Ashley High
Ashley High
Numerade Educator
02:18

Problem 6

Develop a routine to perform a three-point perspective projection of an object.

Foster Wisusik
Foster Wisusik
Numerade Educator
03:54

Problem 7

Write a program that uses the routines in the previous three exercises to display a threedimensional cube using a one-, two-, or threepoint perspective projection according to input taken from the keyboard, which should be used to switch between propections. The program should also allow the user to rotate the cube in the $x z$ plane around its center. Examine the visual differences of the three different types of projections.

Foster Wisusik
Foster Wisusik
Numerade Educator
01:35

Problem 8

Write a routine to convert a perspective projection frustum to a regular parallelepiped.

Freddie Montague
Freddie Montague
Numerade Educator
01:00

Problem 9

Modify the two-dimensional Cohen-Sutherland line-clipping algorithm to clip three-dimensional lines against the normalized symmetric view volume square.

Suzanne W.
Suzanne W.
Numerade Educator
05:53

Problem 10

Write a program to generate a set of 10 random lines, each of which has one endpoint within a normalized symmetric view volume and one without. Implement the three-dimensional Cohen-Sutherland line-clipping algorithm designed in the previous exercise to clip the set of lines against the viewing volume.

Morgan Cheatham
Morgan Cheatham
Numerade Educator
01:57

Problem 11

Modify the two-dimensional Liang-Barsky lineclipping algorithm to clip three-dimensional lines against a specified regular parallelepiped.

WZ
Wen Zheng
Numerade Educator
05:53

Problem 12

Write a program similar to that in Exercise 10 that generates a set of 10 random lines, each partially outside of a specified regular parallelepiped viewing volume. Use the three-dimensional Liang-Barsky line-clipping algorithm developed in the previous exercise to clip the lines against the viewing volume.

Morgan Cheatham
Morgan Cheatham
Numerade Educator
00:48

Problem 13

Modify the two-dimensional Liang-Barsky lineclipping algorithm to clip a given polyhedron against a specified regular parallelepiped.

Allison Knapp
Allison Knapp
Numerade Educator
01:12

Problem 14

Writea program to display a cube in a regular paralleleplped viewing volume and allow the user to translate the cube along each axis using keyboard input. Implement the algorithm in the previous exercise to clip the cube when it extends over any of the edges of the viewing volume.

Christopher Stanley
Christopher Stanley
Numerade Educator
01:18

Problem 15

Write a routine to perform line clipping in homogeneous coordinates.

Lucas Finney
Lucas Finney
Numerade Educator
04:21

Problem 16

Devise an algorithm to clip a polyhedron against a defined frustum. Compare the operations needed in this algorithm to those needed in an algorithm that clips against a regular parallelepiped.

Willis James
Willis James
Numerade Educator
06:21

Problem 17

Extend the Sutherland-Hodgman polygonclipping algorithm to clip a convex polyhedron against a normalized symmetric view volume.

Chris Trentman
Chris Trentman
Numerade Educator
01:43

Problem 18

Write a routine to implement the preceding exercise.

Kaylee Mcclellan
Kaylee Mcclellan
Numerade Educator
05:14

Problem 19

Write a program similar to the one in Exercise 14 to display a cube in a normalized symmetric view volume that can be translated around the viewing volume via keyboard input. Use the implementation of the polygon-clipping algorithm developed in the previous exercise to clip the cube when it extends over the edge of the viewing volume.

Mike Gaerlan
Mike Gaerlan
Numerade Educator
00:39

Problem 20

Write a routine to perform polyhedron clipping in homogeneous coordinates.

Allison Knapp
Allison Knapp
Numerade Educator
01:16

Problem 21

Modify the program example in Section 10 to allow a user to specify a view for either the front or the back of the square.

Nick Johnson
Nick Johnson
Numerade Educator
01:16

Problem 22

Modify the program example in Section 10 to allow the perspective viewing parameters to be specified as user input.

Nick Johnson
Nick Johnson
Numerade Educator
01:06

Problem 23

Modify the program example in Section 10 to produce a view of any input polyhedron.

Carson Merrill
Carson Merrill
Numerade Educator
01:04

Problem 24

Modify the program in the preceding exercise to generate a view of the polyhedron using an orthographic projection.

Ashley High
Ashley High
Numerade Educator
01:34

Problem 25

Modify the program in the preceding exercise to generate a view of the polyhedron using an oblique parallel projection.

Jay Patel
Jay Patel
Numerade Educator