Scientic Visualization Winter term 2007/2008 Exam 1

Department of Computer Science Informatik 15 Computer Graphics & Visualization

Page 1 of 8

Prof. R. Westermann, J. Georgii

TU Mnchen, 04.02.2008

Exam Scientic Visualization (Group 1)

Surname Given name Program of study Matriculation number

Room number

Row number

Seat number

Signature

Manifestations:
Please ll out the above form completely. Do not forget your signature. You must not use pencil, neither red nor green ink! Use free space below each item or on the back for your solution. Ask for additional paper if space turns out to be insufcient. You must not use any auxiliary items. In case of attempted deceit you will fail the exam! You can score a maximum of 100 points in this exam. You have 75 minutes. Ensure that you have received all 8 pages.

Page 2 of 8

Assignment 1

[13 Points] The Visualization Pipeline

a) Order the following eight stages as they occur in the visualization pipeline top to down: raw data, ltering, display images, data acquisition, rendering, vis data, mapping, renderable representation. b) Name at least two different data sources in the data acquisition step. c) In which stages are the following actions performed? 1) Selection of a sub-region in a data set for visualization 2) Change of the integration scheme for particle tracing 3) Change of lighting parameters d) For each of the following problems name two visualization algorithms that are typically applied to solve the problem. i) Visualization of medical CT data. ii) Visualization of wind tunnel simulations.

Page 3 of 8

Assignment 2

[12 Points] Multiple Choice

Please answer the following questions. Be careful; a wrong answer yields -1 point, a correct answer yields 1 point. If no choice is marked, you will get 0 points. A negative overall point count in this assignment is clamped to zero. a) Amira is a tool to perform uid simulation. b) Programming with Amira requires to write lines of text-code. c) Forward and backward differences approximate a derivative by the same order of approximation. d) The weighting functions in a trilinear interpolation scheme are linear. e) CT scans allow to distinguish bone from other organic materials. f) All triangulations fulll the Delaunay property. g) The Bowyer-Watson algorithm computes iso contours. h) A Sobel lter smoothes an image. 0 1 1 i) The lter 1 0 1 smoothes an image. 1 1 0 j) Height elds are a visualization technique for 2D scalar elds. k) Path lines and stream lines are identical in steady ows. l) The Line Integral Convolution smoothes a noise texture perpendicular to the stream lines. Yes Yes No No

Yes Yes Yes Yes Yes Yes Yes

No No No No No No No

Yes Yes

No No

Yes

No

Page 4 of 8

Assignment 3

[18 Points] Scalar Field Visualization

Given is the following grid consisting of quadrilaterals and triangles. At the grid vertices, which are marked by a solid dot, scalar values in the range of (0,1) are given:

0.8

0.6

0.2

a) Compute the scalar values at the samples marked with a cross using the appropriate interpolation schemes we have discussed in the lecture. Assume that the two samples are centered in the quadrilateral and on the edge, respectively. b) By using the same interpolation schemes as in a), sketch all points with a value equal to 0.5. c) Now assume that the marching squares algorithm is used to reconstruct an iso-contour in the data. Is this contour always unique for quadrilaterals? If not, describe two methods to resolve the ambiguity. Are both methods always producing the same results? If not, sketch an example where different results are generated. d) Interpolation in a triangle is usually performed using so-called barycentric coordinates. Explain the geometrical interpretation of the interpolation weights and explain how to obtain them. Write down the interpolation formula for a scalar eld given at the triangles vertices. Are the weights depending on the scalar eld?

Page 5 of 8

Assignment 4

[12 Points] Vector Calculus

Given the following analytical vector eld R3 R3 : y x y := x 0 z a) Compute the rotation (also called curl) of . b) Compute the divergence of . c) Does the eld contain a source or a sink? Justify your answer! d) A critical point of a given eld : R2 R2 is a location ( x, y) such that ( x, y) = (0, 0). Assume you have a 2D Cartesian grid. Describe an algorithm that tests for a particular cell whether it contains a critical point.

Page 6 of 8

Assignment 5

[18 Points] Characteristic Lines

Given is the following cell in a Cartesian grid. At each of the vertices marked with a solid dot, a velocity vi is given. Velocity directions are illustrated by the arrows shown in the gure below.

a) Write down the bilinear interpolation polynomial ( x, y) for the velocity inside the cell. b) Insert the values given for v0 , . . . , v3 into the polynomial: v0 :=

0.2 0.2

, v1 :=

0.2 0.2

, v2 :=

0 0.2

, v3 :=

0 0.3

c) Numerically compute a stream line using Euler integration. Choose

3 as starting point. Assume a 2 stepsize of 1 for the Euler integration scheme and compute the rst two steps along the stream line.

d) Explain the difference between stream lines and streak lines.

Page 7 of 8

Assignment 6

[13 Points] Alpha-Compositing

Given two Red Green Blue colors with associated opacity a: c1 = (1, 0, 1), a1 = 0.3, c2 = (1, 1, 0), a2 = 0.5. Assume a background of c0 = (0, 0, 0), a0 = 1. For front to back ordering, initialize your color with c f = (0, 0, 0), a f = 0
111111111111 000000000000 111111111111 000000000000 11111111111 00000000000 111111111111 000000000000 111111111111 11111111111 Background000000000000 Background 00000000000 Background 111111111111 000000000000 111111111111 000000000000 11111111111 00000000000

c2 c1 5a) 5b)

c2 c1 5c)

c1 c2

Write down the formula and the result for compositing the following colors (see the above gure for details). Write down into the tables each intermediate color and alpha value of the compositing process! a) c1 and c2 in back to front order (see Figure 5a) ),

step 1 2 3

color

alpha

b) c1 and c2 in front to back order (see Figure 5b) ),

step 1 2 3 4

color

alpha

c) Suppose you change the order given in Figure 5b) to the order shown in the Figure 5c). Does the result remain the same? Explain why or why not!

Page 8 of 8

Assignment 7

[14 Points] Delaunay Triangulation

Given is the following triangulation:

a) Describe in detail an algorithm that computes a Delaunay triangulation from an arbitrary triangulation. b) Explain, why the shown triangulation in the gure above is not a Delaunay triangulation. c) Apply the algorithm described in a) to generate a Delaunay triangulation of the given triangulation. Draw all triangulations that are generated in the course of the algorithm into the gure below; describe the single steps of the algorithm.