Presentation is loading. Please wait.

Presentation is loading. Please wait.

GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011.

Published by Modified over 9 years ago

Similar presentations

Presentation on theme: "GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011."— Presentation transcript:

1 GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011

2 Agenda Today’s slides  Matrix Operations on the GPU  OpenGL Textures and Multitexturing  OpenGL Framebuffers and Deferred Shading  Ambient Occlusion

3 Matrix Operations (thanks too…) Slide information sources  Suresh Venkatasubramanian CIS700 – Matrix Operations Lectures  Fast matrix multiplies using graphics hardware by Larsen and McAllister  Dense Matrix Multiplication by Ádám Moravánszky  Cache and Bandwidth Aware Matrix Multiplication on the GPU, by Hall, Carr and Hart  Understanding the Efficiency of GPU Algorithms for Matrix-Matrix Multiplication by Fatahalian, Sugerman, and Harahan  Linear algebra operators for GPU implementation of numerical algorithms by Krüger and Westermann

4 Overview 3 Basic Linear Algebra Operations  Vector-Vector Operations c=a. b  Matrix-Matrix Operations C=A+B - addition D=A*B - multiplication E = E -1 - inverse  Matrix-Vector Operations y=Ax Note on Notation: 1) Vectors - lower case, underlined: v 2) Matrices – upper case, underlined 2x : M 3) Scalar – lower case, no lines: s

5 Efficiency/Bandwidth Issues GPU algorithms are severely bandwidth limited! Minimize Texture Fetches Effective cache bandwidth… so no algorithm would be able to read data from texture very much faster with texture fetches

6 Vector-Vector Operations Inner Product Review An inner product on a vector space (V) over a field (K) (which must be either the field R of real numbers or the field C of complex numbers) is a function :VxV→K such that, k 1, k 2 in K for all v,w in V the following properties hold: 1. = + 2. = ά (linearity constraints) ____ 3. = (conjugate symmetry) 4. ≥ 0 (positive definite)

7 Vector-Vector Operations Inner Product Review A vector space together with an inner product on it is called an inner product space. Examples include: 1. The real numbers R where the inner product is given by = xy 2. The Euclidean space R n where the inner product is given by the dot product: c = a.b c = c = a 1 b 1 +a 2 b 2 +…+a n b n c = ∑a i b i 3. The vector space of real functions with a closed domain [a,b] = ∫ f g dx

8 Vector-Vector Operations Inner Product Review A vector space together with an inner product on it is called an inner product space. Examples include: 1. The real numbers R where the inner product is given by = xy 2. The Euclidean space R n where the inner product is given by the dot product: c = a.b c = c = a 1 b 1 +a 2 b 2 +…+a n b n c = ∑a i b i 3. The vector space of real functions with a closed domain [a,b] = ∫ f g dx

9 Vector-Vector Operations Dot Product: Technique 1  (Optimized for memory) - Store each vector as a 1D texture a and b - In the ith rendering pass we render a single point at coordinates (0,0) which has a single texture coordinate i - The Fragment program uses I to index into the 2 textures and return the value s + a i *b i ( s is the running sum maintained over the previous i-1 passes)

10 Vector-Vector Operations Dot Product: Technique 1: Problems?  We cannot read and write to the location s is stored in a single pass, we need to use a ping-pong trick to maintain s accurately  Takes n-passes Requires only a fixed number of texture locations (1 unit of memory)  Does not take advantage of 2D spatial texture caches on the GPU that are optimized by the rasterizer  Limited length of 1d textures, especially in older cards

11 Vector-Vector Operations Dot Product: Technique 2  (optimized for passes) - Wrap a and b as 2D textures

12 Vector-Vector Operations Dot Product: Technique 2 - Multiply the two 2D textures by rendering a single quad with the answer - Add the elements in (c) the result 2D texture together

13 Vector-Vector Operations Adding up a texture elements to a scalar value  Additive blending  Or parallel reduction algorithm (log n passes) //example Fragment program for performing a reduction float main (float2 texcoord: TEXCOORD0, uniform sampler2D img): COLOR { float a, b, c, d; a=tex2D(img, texcoord); b=tex2D(img, texcoord + float2(0,1) ); c=tex2D(img, texcoord + float2(1,0) ); d=tex2D(img, texcoord + float2(1,1) ); return (a+b+c+d); }

14 Matrix-Matrix Operations Store matrices as 2D textures glTexImage2D(GL_TEXTURE_2D, 0,GL_RED, 256, 256, 0, GL_RED, GL_UNSIGNED_BYTE, pData);

15 Matrix-Matrix Operations Store matrices as 2D textures Addition is now a trivial fragment program /additive blend

16 Matrix-Matrix Operations Matrix Multiplication Review So in other words we have: In general: (AB) ij = ∑ r=0 a ir b rj Naïve O(n 3 ) CPU algorithm for i = 1 to n for j = 1 to n C[i,j] = ∑ A[I,k] * B[k,j]

17 Matrix-Matrix Operations GPU Matrix Multiplication: Technique 1 Express multiplication of two matrices as dot product of vector of matrix row and columns Compute matrix C by: for each cell of cij take the dot product of row I of matrix A with column j of matrix B

18 Matrix-Matrix Operations GPU Matrix Multiplication: Technique 1 Pass1 Output = a x1 * b 1y Pass2 Output = Output 1 +a x2 * b 2y ….. PassK Output = Output k-1 + a xk * b ky Uses: n passes Uses: N=n2 space

19 Matrix-Matrix Operations GPU Matrix Multiplication: Technique 2 Blocking Instead of making one computation per pass. Compute multiple additions per pass in the fragment program. Pass1 Output = a x1 * b 1y + a x2 * b 2y +… + a xb * b by ….. Passes: = n/Blockssize Now there is a tradeoff between passes and program size/fetches

20 Matrix-Matrix Operations GPU Matrix Multiplication: Technique 3  Modern fragment shaders allow up to 4 instructions to be executed simultaneously (1) output = v1.abgr*v2.ggab This is issued as a single GPU instruction and numerically equivalent to the following 4 instructions being executed in parallel (2) output.r = v1.a *v2.g output.g = v1.b * v2.g output.b = v1.g * v2.a output.a = v1.r * v2.b In v1.abgr the color channels are referenced in arbitrary order. This is referred to as swizzling. In v2.ggab the color channel (g) is referenced multiple times. This is referred to as smearing.

21 Matrix-Matrix Operations Up until now we have been using 1 channel, the red component to store the data, why now store data across all the channels (RGBA) and compute instructions 4 at a time GPU Matrix Multiplication: Technique 3 Smearing/Swizzling The matrix multiplication can be expressed as follows: Suppose we have 2 large matrices A B, wog whose dimensions are power of 2s A 11, a 12 … are sub matrices of 2 i-1 rows/columns

22 Matrix-Matrix Operations Note on Notation: C(r)=A(r)*B(r) used to denote the channels Example: So now the final matrix multiplication can be expressed recursively by:

23 Matrix-Matrix Operations Efficiency/Bandwidth Issues  Problem with matrix multiplication is each input contributes to multiple outputs O(n)  Arithmetic performance is limited by cache bandwidth  Multipass algorthims tend to be more cache friendly 2 Types of Bandwidth -External Bandwidth: Data from the CPU  GPU transfers limited by the AGP or PCI express bus - Internal Bandwidth (Blackbox): read from textures/write to textures tend to be expensive - Back of the envelope calculation: ((2 texture read/write lookups) *blocksize + 2(previous pass lookup)*(prescion)(n 2 ) - (2*32 + 2)(32)(1024) = 4GB of Data being thrown around

24 GPU Benchmarks 164 50 75 10 125 150 175 59006800 ATI9800ATIX800 GFLOPS Peak Arithmetic Rate 7800 Pent IV 54 520 8800 330 ATIX1900 22 25 0

25 Previous Generation GPUs 0 2 4 6 8 10 12 P4 3Ghz 5900 Ultra9800 XT 0 5 10 15 20 25 30 GFLOPS Bandwidth Multiplication of 1024x1024 Matrices GFLOPS GB/sec

26 Next Generation GPUs 0 2 4 6 8 10 12 P4 3Ghz 6800 UltraX800 XT PE 0 5 10 15 20 25 30 GFLOPS Bandwidth Multiplication of 1024x1024 Matrices GFLOPS GB/sec

27 Matrix-Vector Operations Matrix Vector Operation Review Example 1: Example 2:

28 Matrix-Vector Operations Technique 1: Just use a Dense Matrix Multiply Pass1 Output = a x1 * b 11 + a x2 * b 21 +… + a xb * b b1 ….. Passes: = n/Blockssize

29 Matrix-Vector Operations Technique 2: Sparse Banded Matrices (A * x = y) A band matrix is a sparse matrix whose nonzero elements are confined to diagonal bands Algorithm: - Convert Diagonal Bands to vectors - Convert (N) vectors to 2D-textures, pad with 0 if they do not fill the texture completely

30 Matrix-Vector Operations Technique 2: Sparse Banded Matrices - Convert the multiplication Vector (x) to a 2D texture - Pointwise multiply (N) Diagonal textures with (x) texuture - Add the (N) resulting matrices to form a 2D texuture - unwrap the 2D texture for the final answer

31 Matrix-Vector Operations Technique 3: Sparse Matrices Create a texture lookup scheme

32 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id);

33 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Pixels for an image in system memory.

34 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Standard business.

35 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); I hate global state. You should too. What is the alternative design?

36 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Sampler state. More info to follow.

37 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Transfer from system memory to driver-controlled (likely, GPU) memory. Does it need to block?

38 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Pixel data format and datatype

39 Textures unsigned char *pixels = //... GLuint id; glGenTextures(1, &id); glBindTexture(GL_TEXTURE_2D, id); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MIN_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_MAG_FILTER, GL_LINEAR); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_S, GL_REPEAT); glTexParameterf(GL_TEXTURE_2D, GL_TEXTURE_WRAP_T, GL_REPEAT); glTexImage2D(GL_TEXTURE_2D, 0, GL_RGBA, width, height, 0, GL_BGRA, GL_UNSIGNED_BYTE, pixels); //... glDeleteTextures(1, &id); Internal (GPU) texture format

40 Texture Wrap Parameters Images from: http://http.download.nvidia.com/developer/NVTextureSuite/Atlas_Tools/Texture_Atlas_Whitepaper.pdf GL_MIRRORED_REPEAT GL_REPEAT GL_CLAMP Set with:  glTexParameteri ()

41 Multitexturing Using multiple textures in the same rendering pass Each is bound to a different texture unit and accessed with a different sampler uniform in GLSL

42 Multitexturing: Light Map Recall our Light Map example: x = Precomputed lightSurface color “lit” surface

43 Multitexturing: Light Map uniform sampler2D lightMap; uniform sampler2D surfaceMap; in vec2 fs_TxCoord; in vec3 out_Color; void main(void) { float intensity = texture(lightMap, fs_TxCoord).r; vec3 color = texture(surfaceMap, fs_TxCoord).rgb; out_Color = intensity * color; } Each texture is accessed with a different sampler

44 Multitexturing: Light Map uniform sampler2D lightMap; uniform sampler2D surfaceMap; in vec2 fs_TxCoord; in vec3 out_Color; void main(void) { float intensity = texture(lightMap, fs_TxCoord).r; vec3 color = texture(surfaceMap, fs_TxCoord).rgb; out_Color = intensity * color; } Pass the sampler to texture() to read from a particular texture

45 Multitexturing: Terrain How was this rendered? Image courtesy of A K Peters, Ltd. www.virtualglobebook.com

46 Multitexturing: Terrain First hint: two textures Images courtesy of A K Peters, Ltd. www.virtualglobebook.com GrassStone

47 Multitexturing: Terrain Second hint: terrain slope Image courtesy of A K Peters, Ltd. www.virtualglobebook.com

48 Multitexturing: Terrain Second hint: terrain slope Image courtesy of A K Peters, Ltd. www.virtualglobebook.com 0 is flat 1 is steep

49 Multitexturing: Terrain Third and final hint: a blend ramp Image courtesy of A K Peters, Ltd. www.virtualglobebook.com

50 Multitexturing: Terrain uniform sampler2D grass; uniform sampler2D stone; uniform sampler2D blendRamp; in vec3 out_Color; void main(void) { //... out_Color = intensity * mix( texture(grass, repeatTextureCoordinate).rgb, texture(stone, repeatTextureCoordinate).rgb, texture(u_blendRamp, vec2(0.5, slope)).r); }

51 Multitexturing: Terrain uniform sampler2D grass; uniform sampler2D stone; uniform sampler2D blendRamp; in vec3 out_Color; void main(void) { //... out_Color = intensity * mix( texture(grass, repeatTextureCoordinate).rgb, texture(stone, repeatTextureCoordinate).rgb, texture(u_blendRamp, vec2(0.5, slope)).r); } Three samplers blendRamp could be 1D; it is just 1xn

52 Multitexturing: Terrain uniform sampler2D grass; uniform sampler2D stone; uniform sampler2D blendRamp; in vec3 out_Color; void main(void) { //... out_Color = intensity * mix( texture(grass, repeatTextureCoordinate).rgb, texture(stone, repeatTextureCoordinate).rgb, texture(u_blendRamp, vec2(0.5, slope)).r); } Use terrain slope to look up a blend value in the range [0, 1]

53 Multitexturing: Terrain uniform sampler2D grass; uniform sampler2D stone; uniform sampler2D blendRamp; in vec3 out_Color; void main(void) { //... out_Color = intensity * mix( texture(grass, repeatTextureCoordinate).rgb, texture(stone, repeatTextureCoordinate).rgb, texture(u_blendRamp, vec2(0.5, slope)).r); } Linearly blend between grass and stone

54 Multitexturing: Globe How will you render this? Imagery from http://planetpixelemporium.com/

55 Multitexturing: Globe How will you render this? Imagery from http://planetpixelemporium.com/ Day texture Night texture

56 Multitexturing: Globe Imagery from http://planetpixelemporium.com/ Day TextureDay Night

57 Multitexturing: Globe Videos  Night and Day Night and Day  Clouds Clouds  Specularity Specularity

58 Framebuffer Objects (FBOs)  Allow fragment shader to write to one or more off-screen buffers  Can then use the off-screen buffer as a texture in a later rendering pass  Allows render to texture  Don’t worry about the OpenGL API; we’ve already coded it for you

59 Framebuffer Objects (FBOs) FBOs are lightweight containers of textures FBO Depth Texture Color Texture 0 Color Texture 1 …

60 Framebuffer Objects (FBOs) FBO use case: post processing effects  Render scene to FBO with depth and color attachment  Render a viewport-aligned quad with texture that was the color attachment and apply effect  How would you design a post processing framework?

61 Deferred Shading FBO use case: deferred shading  Render scene in two passes 1 st pass: Visibility tests 2 nd pass: Shading

62 Deferred Shading 1 st Pass: Render geometry into G-Buffers Fragment ColorsNormals DepthEdge Weight Images from http://http.developer.nvidia.com/GPUGems3/gpugems3_ch19.html

63 Deferred Shading 2 nd pass: shading == post processing effects Render viewport-aligned quads that read from G-Buffers Objects are no longer needed

64 Deferred Shading Light accumulation result Image from http://http.developer.nvidia.com/GPUGems3/gpugems3_ch19.html

65 Deferred Shading What are the benefits:  Shading and depth complexity?  Memory requirements?  Memory bandwidth?  Material and light decoupling?

66 Ambient Occlusion Ambient Occlusion (AO)  "shadowing of ambient light“  "darkening of the ambient shading contribution“ Image from Bavoil and Sainz. http://developer.download.nvidia.com/SDK/10.5/direct3d/Source/ScreenSpaceAO/doc/ScreenSpaceAO.pdf

67 Ambient Occlusion  "the crevices of the model are realistically darkened, and the exposed parts of the model realistically receive more light and are thus brighter“  "the soft shadow generated by a sphere light of uniform intensity surrounding the scene"

68 Ambient Occlusion Image from Iñigo Quílez. http://iquilezles.org/www/articles/ssao/ssao.htm

69 Ambient Occlusion Images courtesy of A K Peters, Ltd. http://www.realtimerendering.com/ Evenly lit from all directions Ambient Occlusion Global Illumination

70 Ambient Occlusion Image from Bavoil and Sainz. http://developer.download.nvidia.com/SDK/10.5/direct3d/Source/ScreenSpaceAO/doc/ScreenSpaceAO.pdf "the integral of the occlusion contributed from inside a hemisphere of a given radius R, centered at the current surface point P and oriented towards the normal n at P"

71 Object Space Ambient Occlusion AO does not depend on light direction Precompute AO for static objects using ray casting  How many rays?  How far do they go?  Local objects? Or all objects?

72 Object Space Ambient Occlusion Image courtesy of A K Peters, Ltd. http://www.realtimerendering.com/ Cosine weight rays or use importance sampling: cosine distribute number of rays

73 Object Space Ambient Occlusion Depends on scene complexity Stored in textures or vertices How can we  Support dynamic scenes  Be independent of scene complexity

74 Screen Space Ambient Occlusion Apply AO as a post processing effect using a combination of depth, normal, and position buffers Not physically correct but plausible Visual quality depends on  Screen resolution  Number of buffers  Number of samples

75 Depth Buffer

76 Normal Buffer

77 View Space Eye Position Buffer

78 Screen Space Ambient Occlusion Images courtesy of A K Peters, Ltd. http://www.realtimerendering.com/

79 Screen Space Ambient Occlusion Image from Martin Mittring. http://developer.amd.com/documentation/presentations/legacy/Chapter8-Mittring-Finding_NextGen_CryEngine2.pdf

80 Screen Space Ambient Occlusion Image from Martin Mittring. http://developer.amd.com/documentation/presentations/legacy/Chapter8-Mittring-Finding_NextGen_CryEngine2.pdf

81 Screen Space Ambient Occlusion Image from Mike Pan. http://mikepan.com Blur depth buffer Subtract it from original depth buffer Scale and clamp image, then subtract from original Superficially resembles AO but fast

Download ppt "GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011."

Similar presentations

Exploration of advanced lighting and shading techniques

Exploration of advanced lighting and shading techniques
POST-PROCESSING SET09115 Intro Graphics Programming.

POST-PROCESSING SET09115 Intro Graphics Programming.
Deferred Shading Optimizations

Deferred Shading Optimizations
Matrix Operations on the GPU CIS 665: GPU Programming and Architecture TA: Joseph Kider.

Matrix Operations on the GPU CIS 665: GPU Programming and Architecture TA: Joseph Kider.
CS123 | INTRODUCTION TO COMPUTER GRAPHICS Andries van Dam © 1/16 Deferred Lighting Deferred Lighting – 11/18/2014.

CS123 | INTRODUCTION TO COMPUTER GRAPHICS Andries van Dam © 1/16 Deferred Lighting Deferred Lighting – 11/18/2014.
Normal Map Compression with ATI 3Dc™ Jonathan Zarge ATI Research Inc.

Normal Map Compression with ATI 3Dc™ Jonathan Zarge ATI Research Inc.
Understanding the graphics pipeline Lecture 2 Original Slides by: Suresh Venkatasubramanian Updates by Joseph Kider.

Understanding the graphics pipeline Lecture 2 Original Slides by: Suresh Venkatasubramanian Updates by Joseph Kider.
Graphics Pipeline.

Graphics Pipeline.
Computer graphics & visualization Global Illumination Effects.

Computer graphics & visualization Global Illumination Effects.
TEXTURE MAPPING JEFF CHASTINE 1. TEXTURE MAPPING Applying an image (or a texture ) to geometry 2D images (rectangular) 3D images (volumetric – such as.

TEXTURE MAPPING JEFF CHASTINE 1. TEXTURE MAPPING Applying an image (or a texture ) to geometry 2D images (rectangular) 3D images (volumetric – such as.
3D Graphics Rendering and Terrain Modeling

3D Graphics Rendering and Terrain Modeling
Matrix Operations on the GPU CIS 665: GPU Programming and Architecture TA: Joseph Kider.

Matrix Operations on the GPU CIS 665: GPU Programming and Architecture TA: Joseph Kider.
GLSL Applications: 1 of 2 Joseph Kider Source: Patrick Cozzi – Spring 2011 University of Pennsylvania CIS 565 - Fall 2011.

GLSL Applications: 1 of 2 Joseph Kider Source: Patrick Cozzi – Spring 2011 University of Pennsylvania CIS Fall 2011.
GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011.

GLSL Applications: 2 of 2 Patrick Cozzi University of Pennsylvania CIS Spring 2011.
Skin Rendering GPU Graphics Gary J. Katz University of Pennsylvania CIS 665 Adapted from David Gosselin’s Power Point and article, Real-time skin rendering,

Skin Rendering GPU Graphics Gary J. Katz University of Pennsylvania CIS 665 Adapted from David Gosselin’s Power Point and article, Real-time skin rendering,
3D Graphics Processor Architecture Victor Moya. PhD Project Research on architecture improvements for future Graphic Processor Units (GPUs). Research.

3D Graphics Processor Architecture Victor Moya. PhD Project Research on architecture improvements for future Graphic Processor Units (GPUs). Research.
Shadow Mapping RTR Team 2009 0. 1 Why Shadows? 2 RTR Team 2009.

Shadow Mapping RTR Team Why Shadows? 2 RTR Team 2009.
Evolution of the Programmable Graphics Pipeline Patrick Cozzi University of Pennsylvania CIS 565 - Spring 2011.

Evolution of the Programmable Graphics Pipeline Patrick Cozzi University of Pennsylvania CIS Spring 2011.
CS 4731: Computer Graphics Lecture 17: Texturing Emmanuel Agu.

CS 4731: Computer Graphics Lecture 17: Texturing Emmanuel Agu.
Texture Mapping A way of adding surface details Two ways can achieve the goal:  Surface detail polygons: create extra polygons to model object details.

Texture Mapping A way of adding surface details Two ways can achieve the goal:  Surface detail polygons: create extra polygons to model object details.

Similar presentations

Ads by Google