Presentation is loading. Please wait.

Presentation is loading. Please wait.

CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.

Similar presentations

Presentation on theme: "CS 352: Computer Graphics Chapter 7: The Rendering Pipeline."— Presentation transcript:


2 CS 352: Computer Graphics Chapter 7: The Rendering Pipeline

3 Interactive Computer GraphicsChapter 8 - 2 Overview Geometric processing: normalization, clipping, hidden surface removal, lighting, projection (front end) Rasterization or scan conversion, including texture mapping (back end) Fragment processing and display

4 Interactive Computer GraphicsChapter 8 - 3 Geometric Processing Front-end processing steps (3D floating point; may be done on the CPU) Evaluators (converting curved surfaces to polygons) Normalization (modeling transform, convert to world coordinates) Projection (convert to screen coordinates) Hidden-surface removal (object space) Computing texture coordinates Computing vertex normals Lighting (assign vertex colors) Clipping Perspective division Backface culling

5 Interactive Computer GraphicsChapter 8 - 4 Rasterization Back-end processing works on 2D objects in screen coordinates Processing includes Scan conversion of primitives including shading Texture mapping Fog Scissors test Alpha test Stencil test Depth-buffer test Other fragment operations: blending, dithering, logical operations

6 Interactive Computer GraphicsChapter 8 - 5 Display Convert frame buffer to video signal Other considerations: Color correction Antialiasing

7 Interactive Computer GraphicsChapter 8 - 6 Geometric Transformations Five coordinate systems of interest: Object coordinates Eye (world) coordinates [after modeling transform, viewer at the origin] Clip coordinates [after projection] Normalized device coordinates [after ÷w] Window (screen) coordinates [scale to screensize]

8 Interactive Computer GraphicsChapter 8 - 7 Line-Segment Clipping Clipping may happen in multiple places in the pipeline (e.g. early trivial accept/reject) After projection, have lines in plane, with rectangle to clip against

9 Interactive Computer GraphicsChapter 8 - 8 Clipping a Line Against x min Given a line segment from (x 1,y 1 ) to (x 2,y 2 ), Compute m=(y 2 –y 1 )/(x 2 –x 1 ) Line equation: y = mx + h h = y 1 – m x 1 (y intercept) Plug in x min to get y Check if y is between y 1 and y 2. This take a lot of floating-point math. How to minimize?

10 Interactive Computer GraphicsChapter 8 - 9 Cohen-Sutherland Clipping For both endpoints compute a 4-bit outcode (o 1, o 2 ) depending on whether coordinate is outside cliprect side Some situations can be handled easily

11 Interactive Computer GraphicsChapter 8 - 10 Cohen-Sutherland Conditions Cases. 1. If o 1 =o 2 =0, accept 2. If one is zero, one nonzero, compute an intercept. If necessary compute another intercept. Accept. 3. If o 1 & o 2  0. If both outcodes are nonzero and the bitwise AND is nonzero, two endpoints lie on same outside side. Reject. 3. If o 1 & o 2  0. If both outcodes are nonzero and the bitwise AND is zero, may or may not have to draw the line. Intersect with one of the window sides and check the result.

12 Interactive Computer GraphicsChapter 8 - 11 Cohen-Sutherland Results In many cases, a few integer comparisons and Boolean operations suffice. This algorithm works best when there are many line segments, and most are clipped But note that the y=mx+h form of equation for a line doesn’t work for vertical lines (need a special case in your code)

13 Interactive Computer GraphicsChapter 8 - 12 Polygon Clipping Clipping a polygon can result in lots of pieces Replacing one polygon with many may be a problem in the rendering pipeline Could treat result as one polygon: but this kind of polygon can cause other difficulties Some systems allow only convex polygons, which don’t have such problems (OpenGL has tessellate function in glu library)

14 Interactive Computer GraphicsChapter 8 - 13 Sutherland-Hodgeman Polygon Clipping Could clip each edge of polygon individually Pipelined approach: clip polygon against each side of rectangle in turn Treat clipper as “black box” pipeline stage

15 Interactive Computer GraphicsChapter 8 - 14 Clipping Pipeline Clip each bound in turn

16 Interactive Computer GraphicsChapter 8 - 15 Clipping in Hardware Build the pipeline stages in hardware so you can perform four clipping stages at once [A partial answer to the question of what to do with all that chip area, 1 billion + transistors…]

17 Interactive Computer GraphicsChapter 8 - 16 Clipping complicated objects Suppose you have many complicated objects, such as models of parts of a person with thousands of polygons each When and how to clip for maximum efficiency? How to clip text? Curves?

18 Interactive Computer GraphicsChapter 8 - 17 Clipping Other Primitives It may help to clip more complex shape early in the pipeline This may be simpler and less accurate One approach: bounding boxes (sometimes called trivial accept-reject) This is so useful that modeling systems often store bounding box

19 Interactive Computer GraphicsChapter 8 - 18 Clipping Curves, Text Some shapes are so complex that they are difficult to clip analytically Can approximate with line segments Can allow the clipping to occur in the frame buffer (pixels outside the screen rectangle aren’t drawn) Called “scissoring” How does performance compare?

20 Interactive Computer GraphicsChapter 8 - 19 Hidden surface removal Object space vs. Image space The main image-space algorithm: depth buffer Drawbacks Aliasing Rendering invisible objects Doesn’t handle transparency correctly How would object-space hidden surface removal work?

21 Interactive Computer GraphicsChapter 8 - 20 Depth sorting The painter’s algorithm: draw from back to front Depth-sort hidden surface removal: sort display list by z-coordinate from back to front render Drawbacks it takes some time (especially with bubble sort!) it doesn’t work

22 Interactive Computer GraphicsChapter 8 - 21 Depth-sort difficulties Polygons with overlapping projections Cyclic overlap Interpenetrating polygons What to do?

23 Interactive Computer GraphicsChapter 8 - 22 Scan Conversion At this point in the pipeline, we have only polygons and line segments. Render! To render, convert to pixels (“fragments”) with integer screen coordinates (ix, iy), depth, and color Send fragments into fragment-processing pipeline

24 Interactive Computer GraphicsChapter 8 - 23 Rendering Line Segments How to render a line segment from (x 1, y 1 ) to (x 2, y 2 )? Use the equation y = mx + h What about horizontal vs. vertical lines?

25 Interactive Computer GraphicsChapter 8 - 24 DDA Algorithm DDA: Digital Differential Analyzer for (x=x 1 ; x<=x 2 ; x++) y += m; draw_pixel(x, y, color) Handle slopes 0 <= m <= 1; handle others symmetrically Does this need floating point math?

26 Interactive Computer GraphicsChapter 8 - 25 Bresenham’s Algorithm The DDA algorithm requires a floating point add and round for each pixel: eliminate? Note that at each step we will go E or NE. How to decide which? −

27 Interactive Computer GraphicsChapter 8 - 26 Bresenham Decision Variable Note that at each step we will go E or NE. How to decide which? Hint: consider d=a-b, where a and b are distances to NE and E pixels −

28 Interactive Computer GraphicsChapter 8 - 27 Bresenham Decision Variable Bresenham algorithm uses decision variable d=a-b, where a and b are distances to NE and E pixels If d 0, go E Let d x = x 2 -x 1, d y =y 2 -y 1 Use decision variable d = d x (a-b) [only sign matters] −

29 Interactive Computer GraphicsChapter 8 - 28 Bresenham Decision Variable d =(a-b) d x Let d k be the value of d at x = k + ½ Move E: d k = d x (a-b) = d x ((j+3/2–y k ) – (y k –(j+1/2))) d k+1 = d x (a-b) = d x ((j+3/2–y k –m) – (y k +m–(j+1/2))) d x+1 – d k = d x (-2m) = - 2 d Y Algorithm: d k+1 = d k – 2 d y (if d k > 0) (last move was E) d k+1 = d k – 2 (d y -d x ) (if d k <= 0) (last move was NE) −

30 Interactive Computer GraphicsChapter 8 - 29 Bresenham’s Algorithm Set up loop computing d at x 1, y 1 for (x=x 1 ; x<=x 2 ; ) x++; d += 2dy; if (d >= 0) { y++; d –= 2dx; } drawpoint(x,y); Pure integer math, and not much of it So easy that it’s usually implemented in one graphics instruction for several points in parallel

31 Interactive Computer GraphicsChapter 8 - 30 Rasterizing Polygons Polygons may be or may not be simple, convex, flat. How to render? Amounts to inside-outside testing: how to tell if a point is in a polygon?

32 Interactive Computer GraphicsChapter 8 - 31 Winding Test Most common way to tell if a point is in a polygon: the winding test. Define “winding number” w for a point: signed number of revolutions around the point when traversing boundary of polygon once When is a point “inside” the polygon?

33 Interactive Computer GraphicsChapter 8 - 32 OpenGL and Complex Polygons OpenGL guarantees correct rendering only for simple, convex, planar polygons OpenGL tessellates concave polygons Tessellation depends on winding rule you tell OpenGL to use: Odd, Nonzero, Pos, Neg, ABS_GEQ_TWO

34 Interactive Computer GraphicsChapter 8 - 33 Winding Rules

35 Interactive Computer GraphicsChapter 8 - 34 Scan-Converting a Polygon General approach: ideas? One idea: flood fill Draw polygon edges Pick a point (x,y) inside and flood fill with DFS flood_fill(x,y) { if (read_pixel(x,y)==white) { write_pixel(x,y,black); flood_fill(x-1,y); flood_fill(x+1,y); flood_fill(x,y-1); flood_fill(x,y+1);}

36 Interactive Computer GraphicsChapter 8 - 35 Scan-Line Approach More efficient: use a scan-line rasterization algorithm For each y value, compute x intersections. Fill according to winding rule How to compute intersection points? How to handle shading? Some hardware can handle multiple scanlines in parallel

37 Interactive Computer GraphicsChapter 8 - 36 Singularities If a vertex lies on a scanline, does that count as 0, 1, or 2 crossings? How to handle singularities? One approach: don’t allow. Perturb vertex coordinates OpenGL’s approach: place pixel centers half way between integers (e.g. 3.5, 7.5), so scanlines never hit vertices

38 Interactive Computer GraphicsChapter 8 - 37 Aliasing How to render the line with reduced aliasing? What to do when polygons share a pixel?

39 Interactive Computer GraphicsChapter 8 - 38 Anti-Aliasing Simplest approach: area-based weighting Fastest approach: averaging nearby pixels Most common approach: supersampling (compute four values per pixel and avg, e.g.) Best approach: weighting based on distance of pixel from center of line; Gaussian fall-off

40 Interactive Computer GraphicsChapter 8 - 39 Temporal Aliasing Need motion blur for motion that doesn’t flicker Common approach: temporal supersampling render images at several times within frame time interval average results

41 Interactive Computer GraphicsChapter 8 - 40 Display Considerations Color systems Color quantization Gamma correction Dithering and Halftoning

42 Interactive Computer GraphicsChapter 8 - 41 Additive and Subtractive Color

43 Interactive Computer GraphicsChapter 8 - 42 Common Color Models

44 Interactive Computer GraphicsChapter 8 - 43 Color Systems RGB YIQ CMYK HSV, HLS Chromaticity Color gamut

45 Interactive Computer GraphicsChapter 8 - 44 HLS Hue: “direction” of color: red, green, purple, etc. Saturation: intensity. E.g. red vs. pink Lightness: how bright To the right: original, H, S, L

46 Interactive Computer GraphicsChapter 8 - 45 YIQ Used by NTSC TV Y = luma, same as black and white I = in-phase Q = quadrature The eye is more sensitive to blue-orange than purple-green, so more bandwidth is allotted Y = 4 MHz, I = 1.3 MHz, Q = 0.4 MHz, overall bandwidth 4.2 MHz Linear transformation from RBG: Y = 0.299 R + 0.587 G + 0.114 B I = 0.596 R – 0.274 G – 0.321 B Q = 0.211 R – 0.523 G + 0.311 B

47 Interactive Computer GraphicsChapter 8 - 46 Chromaticity Color researchers often prefer chromaticity coordinates: t1 = T1 / (T1 + T2 + T3) t2 = T2 / (T1 + T2 + T3) t3 = T3 / (T1 + T2 + T3) Thus, t1+t2+t3 = 1.0. Use t1 and t2; t3 can be computed as 1-t1-t2 Chromaticity diagram uses XYZ color system based on human perception experiments Y, luminance X, redness (roughly) Z, blueness (roughly)

48 Interactive Computer GraphicsChapter 8 - 47 Color temperature Compute color temperature by comparing chromaticity with that of an ideal black- body radiator Color temperature is that were the headed black- body radiator matches color of light source Higher temperatures are “cooler” colors – more green/blue; warmer colors (yellow-red) have lower temperatures CIE 1931 chromaticity diagram (wikipedia)

49 Interactive Computer GraphicsChapter 8 - 48 Halftoning How do you render a colored image when colors can only be on or off (e.g. inks, for print)? Halftoning: dots of varying sizes [But what if only fixed-sized pixels are available?]

50 Interactive Computer GraphicsChapter 8 - 49 Dithering Dithering (patterns of b/w or colored dots) used for computer screens OpenGL can dither But, patterns can be visible and bothersome. A better approach?

51 Interactive Computer GraphicsChapter 8 - 50 Floyd-Steinberg Error Diffusion Dither Spread out “error term” 7/16 right 3/16 below left 5/16 below 1/16 below right Note that you can also do this for color images (dither a color image onto a fixed 256-color palette)

52 Interactive Computer GraphicsChapter 8 - 51 Color Quantization Color quantization: modifying a full-color image to render with a 256-color palette For a fixed palette (e.g. web-safe colors), can use closest available color, possibly with error-diffusion dither Algorithm for selecting an adaptive palette? E.g. Heckbert Median-Cut algorithm Make a 3-D color histogram Recursively cut the color cube in half at a median Use average color from each resulting box

53 Interactive Computer GraphicsChapter 8 - 52 Hardware Implementations Pipeline architecture for speed (but what about latency?) Originally, whole pipeline on CPU Later, back-end on graphics card Then, whole pipeline in hardware on graphics card Then, parts of pipeline done on GPUs Now, hardware pipeline is gone—done in software on a large number of GPUs

54 Interactive Computer GraphicsChapter 8 - 53 Future Architectures? 20 years ago, performance of 1 M polygons per second cost millions Performance limited by memory bandwidth Main component of price was lots of memory chips Now an iPhone 5 does 115 million triangles (1.8 billion texels) per second Fastest performance today achieved with many cores on each graphics chip (and several chips in parallel) How to use parallel graphics cores/chips? All vertices go through vertex shaders – can do in parallel All fragments go through fragment shaders – can do in parallel Resulting fragments combined into a single image – easy with sufficient memory bandwidth

55 NVidia GeForce GTX 590 Facts “Most powerful graphics card ever built” (of 2011) Dual 512-core GTX 500 GPUs (1024 CUDA unified shaders) 2 x 16 Streaming Multiprocessor (SM) processor groups, each with 32 Streaming Processors (SPs) PhysX physics engine on the card (used for flowing clothing, smoke, debris, turbulence, etc) Memory bandwidth: 327.7 GB/sec Texture fill rate: 77.7 billion/sec 4X antialiasing 3 billion transistors x 2 Real-time ray tracing Power: 365 w Interactive Computer GraphicsChapter 8 - 54

Download ppt "CS 352: Computer Graphics Chapter 7: The Rendering Pipeline."

Similar presentations

Ads by Google