09/16/03CS679 - Fall 2003 - Copyright Univ. of Wisconsin Last Time Environment mapping Light mapping Project Goals for Stage 1.

Slides:



Advertisements
Similar presentations
16.1 Si23_03 SI23 Introduction to Computer Graphics Lecture 16 – Some Special Rendering Effects.
Advertisements

Lecture 8 Transparency, Mirroring
Compositing and Blending Ed Angel Professor Emeritus of Computer Science University of New Mexico 1 E. Angel and D. Shreiner: Interactive Computer Graphics.
CS 352: Computer Graphics Chapter 7: The Rendering Pipeline.
Ray tracing. New Concepts The recursive ray tracing algorithm Generating eye rays Non Real-time rendering.
Understanding the graphics pipeline Lecture 2 Original Slides by: Suresh Venkatasubramanian Updates by Joseph Kider.
Graphics Pipeline.
University of Sulaimani - School of Science - Computer Dept.
Computer Graphic Creator: Mohsen Asghari Session 2 Fall 2014.
CSL 859: Advanced Computer Graphics Dept of Computer Sc. & Engg. IIT Delhi.
Texture Mapping. Texturing  process that modifies the appearance of each point on a surface using an image or function  any aspect of appearance can.
Week 7 - Monday.  What did we talk about last time?  Specular shading  Aliasing and antialiasing.
Week 10 - Monday.  What did we talk about last time?  Global illumination  Shadows  Projection shadows  Soft shadows.
Real-Time Rendering TEXTURING Lecture 02 Marina Gavrilova.
9/25/2001CS 638, Fall 2001 Today Shadow Volume Algorithms Vertex and Pixel Shaders.
Real-Time Rendering SPEACIAL EFFECTS Lecture 03 Marina Gavrilova.
University of Texas at Austin CS 378 – Game Technology Don Fussell CS 378: Computer Game Technology Beyond Meshes Spring 2012.
Computer Graphics Inf4/MSc Computer Graphics Lecture 11 Texture Mapping.
09/18/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Bump Mapping Multi-pass algorithms.
9/20/2001CS 638, Fall 2001 Today Finishing Up Reflections More Multi-Pass Algorithms Shadows.
Computer Graphics: Programming, Problem Solving, and Visual Communication Steve Cunningham California State University Stanislaus and Grinnell College.
Shadows Computer Graphics. Shadows Shadows Extended light sources produce penumbras In real-time, we only use point light sources –Extended light sources.
Erdem Alpay Ala Nawaiseh. Why Shadows? Real world has shadows More control of the game’s feel  dramatic effects  spooky effects Without shadows the.
Computer Graphics Mirror and Shadows
Computer Graphics Inf4/MSc Computer Graphics Lecture 7 Texture Mapping, Bump-mapping, Transparency.
University of Illinois at Chicago Electronic Visualization Laboratory (EVL) CS 426 Intro to 3D Computer Graphics © 2003, 2004, 2005 Jason Leigh Electronic.
Modelling and Simulation Types of Texture Mapping.
CS 638, Fall 2001 Today Light Mapping (Continued) Bump Mapping with Multi-Texturing Multi-Pass Rendering.
CS 638, Fall 2001 Admin Grad student TAs may have had their accounts disabled –Please check and the lab if there is a problem If you plan on graduating.
Chris Kerkhoff Matthew Sullivan 10/16/2009.  Shaders are simple programs that describe the traits of either a vertex or a pixel.  Shaders replace a.
Shading & Texture. Shading Flat Shading The process of assigning colors to pixels. Smooth Shading Gouraud ShadingPhong Shading Shading.
09/09/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Event management Lag Group assignment has happened, like it or not.
09/11/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Graphics Pipeline Texturing Overview Cubic Environment Mapping.
Week 2 - Friday.  What did we talk about last time?  Graphics rendering pipeline  Geometry Stage.
Game Programming (Mapping) Spring.
Advanced Computer Graphics Depth & Stencil Buffers / Rendering to Textures CO2409 Computer Graphics Week 19.
CS 638, Fall 2001 Multi-Pass Rendering The pipeline takes one triangle at a time, so only local information, and pre-computed maps, are available Multi-Pass.
1 10/24/ :01 UML Graphics II Shadows Session 4.
Multi-pass Rendering. © 2002 James K. Hahn, N.H. Baek2 Multi-pass Rendering Repeat: image  Rendering pass  result imageRepeat: image  Rendering pass.
Computer Graphics The Rendering Pipeline - Review CO2409 Computer Graphics Week 15.
CS-378: Game Technology Lecture #4: Texture and Other Maps Prof. Okan Arikan University of Texas, Austin V Lecture #4: Texture and Other Maps.
Advanced Computer Graphics Advanced Shaders CO2409 Computer Graphics Week 16.
CS-378: Game Technology Lecture #7: More Mapping Prof. Okan Arikan University of Texas, Austin Thanks to James O’Brien, Steve Chenney, Zoran Popovic, Jessica.
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
CS 325 Introduction to Computer Graphics 04 / 12 / 2010 Instructor: Michael Eckmann.
Computing & Information Sciences Kansas State University Lecture 12 of 42CIS 636/736: (Introduction to) Computer Graphics CIS 636/736 Computer Graphics.
11/5/2002 (c) University of Wisconsin, CS 559 Last Time Local Shading –Diffuse term –Specular term –All together –OpenGL brief overview.
09/25/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Shadows Stage 2 outline.
What are shaders? In the field of computer graphics, a shader is a computer program that runs on the graphics processing unit(GPU) and is used to do shading.
Real-Time Dynamic Shadow Algorithms Evan Closson CSE 528.
Shadows David Luebke University of Virginia. Shadows An important visual cue, traditionally hard to do in real-time rendering Outline: –Notation –Planar.
09/23/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Reflections Shadows Part 1 Stage 1 is in.
Module 05 –Bump mapping Module 05 – Bump mapping Module 05 Advanced mapping techniques: Bump mapping.
Stenciling Effects Glenn G. Chappell
Discrete Techniques.
CS-378: Game Technology Lecture #7: More Mapping Prof. Okan Arikan
Week 7 - Monday CS361.
Week 2 - Friday CS361.
Game Programming (Mapping)
Deferred Lighting.
Bump Mapping -1 Three scales of detail on an object
The Graphics Rendering Pipeline
© University of Wisconsin, CS559 Fall 2004
(c) 2002 University of Wisconsin
© University of Wisconsin, CS559 Fall 2004
Texture and Shadow Mapping
CS-378: Game Technology Lecture #4: Texture and Other Maps
Last Time Presentation of your game and idea Environment mapping
Ref: OpenGL Programming Guide (The Red Book)
Frame Buffer Applications
Presentation transcript:

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Last Time Environment mapping Light mapping Project Goals for Stage 1

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Today Bump Maps Multi-Pass Rendering

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Bump Mapping Bump mapping modifies the surface normal vector according to information in the map Light dependent: the appearance of the surface depends on the lighting direction View dependent: the effect of the bumps may depend on which direction the surface is viewed from Bump mapping can be implemented with multi-texturing, multi-pass rendering, or pixel shaders

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Storing the Bump Map Several options for what to store in the map –The normal vector to use –An offset to the default normal vector –Data derived from the normal vector –Illumination changes for a fixed view

09/16/03CS679 - Fall Copyright Univ. of Wisconsin View Dependent Bump Maps Store four maps (or more) showing the illumination effects of the bumps from four (or more) view directions –Bump maps on diffuse surfaces just make them lighter or darker - don’t change the color At run time: –Compute the dot product of the view direction with the ideal view direction for each bump map Bump maps that were computed with views near the current one will have big dot products –Use the computed dot product as a blend factor when applying each bump map –Must be able to specify the blend function to the texture unit

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Embossing Apply height field as a modulating texture map First application, apply it in place Second application, shift it by amount that depends on the light direction, and subtract it

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Dot Product (dot3) bump mapping Store normal vectors in the bump map Specify light directions instead of colors at the vertices Apply the bump map using the dot3 operator –Takes a dot product Lots of details: –Light directions must be normalized – can be done with a cubic environment map –How do you get the color in? –How do you do specular highlights?

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Dot Product Results

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Environment Bump Mapping Perturb the environment map lookup directions with the bump map

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Environment Bump Map Results

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Multi-Pass Rendering The pipeline takes one triangle at a time, so only local information and pre-computed maps are available Multi-pass techniques render the scene, or parts of the scene, multiple times –Makes use of auxiliary buffers to hold information –Make use of tests and logical operations on values in the buffers –Really, a set of functionality that can be used to achieve a wide range of effects Mirrors, shadows, bump-maps, anti-aliasing, compositing, …

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Buffers Buffers allow you to store global information about the rendered scene –Like scratch work space, or extra screen memory –They are only cleared when you say so –This functionality is fundamentally different from that of vertex or pixel shaders Buffers are defined by: –The type of values they store –The logical operations that they influence –The way they are accessed (written and read)

09/16/03CS679 - Fall Copyright Univ. of Wisconsin OpenGL Buffers Color buffers: Store RGBA color information for each pixel –OpenGL actually defines four or more color buffers: front/back (double buffering), left/right (stereo) and auxiliary color buffers Depth buffer: Stores depth information for each pixel Stencil buffer: Stores some number of bits for each pixel Accumulation buffer: Like a color buffer, but with higher resolution and different operations

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Fragment Tests A fragment is a pixel-sized piece of shaded polygon, with color and depth information –After pixel shaders and/or texturing The tests and operations performed with the fragment on its way to the color buffer are essential to understanding multi-pass techniques Most important are, in order: –Alpha test –Stencil test –Depth test –Blending Tests must be explicitly enabled As the fragment passes through, some of the buffers may also have values stored into them

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Alpha Test The alpha test either allows a fragment to pass, or stops it, depending on the outcome of a test: Here,  fragment is the fragment’s alpha value, and  reference is a reference alpha value that you specify op is one of:, >= There are also the special tests: Always and Never –Always let the fragment through or never let it through What is a sensible default? if (  fragment op  reference ) pass fragment on

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Billboards Billboards are texture-mapped polygons, typically used for things like trees –Image-based rendering method where complex geometry (the tree) is replaced with an image placed in the scene (the textured polygon) The texture has alpha values associated with it: 1 where the tree is, and 0 where it isn’t –So you can see through the polygon in places where the tree isn’t

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Alpha Test and Billboards You can use texture blending to make the polygon see through, but there is a big problem –What happens if you draw the billboard and then draw something behind it? –Hint: Think about the depth buffer values –This is one reason why transparent objects must be rendered back to front The best way to draw billboards is with an alpha test: Do not let alpha < 0.5 pass through –Depth buffer is never set for fragments that are see through –Doesn’t work for partially transparent polygons - more later

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Stencil Buffer The stencil buffer acts like a paint stencil - it lets some fragments through but not others It stores multi-bit values – you have some control of #bits You specify two things: –The test that controls which fragments get through –The operations to perform on the buffer when the test passes or fails –All tests/operation look at the value in the stencil that corresponds to the pixel location of the fragment Typical usage: One rendering pass sets values in the stencil, which control how various parts of the screen are drawn in the second pass

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Stencil Tests You give an operation, a reference value, and a mask Operations: –Always let the fragment through –Never let the fragment through –Logical operations between the reference value and the value in the buffer:, >= The mask is used to select particular bit-planes for the operation –(reference & mask ) op ( buffer & mask )

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Stencil Operations Specify three different operations –If the stencil test fails –If the stencil passes but the depth test fails –If the stencil passes and the depth test passes Operations are: –Keep the current stencil value –Zero the stencil –Replace the stencil with the reference value –Increment the stencil –Decrement the stencil –Invert the stencil (bitwise)

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Depth Test and Operation Depth test compares the depth of the fragment and the depth in the buffer –Depth increases with greater distance from viewer Tests are: Always, Never,, >= Depth operation is to write the fragments depth to the buffer, or to leave the buffer unchanged –Why do the test but leave the buffer unchanged? Each buffer stores different information about the pixel, so a test on one buffer may be useful in managing another

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Multi-Pass Algorithms Designing a multi-pass algorithm is a non-trivial task –At least one person I know of has received a PhD for developing such algorithms References for multi-pass algorithms: –Real Time Rendering has them indexed by problem –The OpenGL Programming guide discusses many multi-pass techniques in a reasonably understandable manner –Game Programming Gems has some –Watt and Policarpo has others –Several have been published as academic papers

09/16/03CS679 - Fall Copyright Univ. of Wisconsin Todo By Monday, Sept 22: Lock in Stage 1