Interactive Shadow Generation in Complex Environments Naga K. Govindaraju, Brandon Lloyd, Sung-Eui Yoon, Avneesh Sud, Dinesh Manocha Speaker: Alvin Date:

Slides:



Advertisements
Similar presentations
15.1 Si23_03 SI23 Introduction to Computer Graphics Lecture 15 – Visible Surfaces and Shadows.
Advertisements

8.1si31_2001 SI31 Advanced Computer Graphics AGR Lecture 8 Polygon Rendering.
Exploration of advanced lighting and shading techniques
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware.
Object Space EWA Surface Splatting: A Hardware Accelerated Approach to High Quality Point Rendering Liu Ren Hanspeter Pfister Matthias Zwicker CMU.
Advanced Light and Shadow Culling Methods Eric Lengyel.
Game Programming 09 OGRE3D Lighting/shadow in Action
Visibility in Games Harald Riegler. 2 / 18 Visibility in Games n What do we need it for? u Increase of rendering speed by removing unseen scene data from.
Two Methods for Fast Ray-Cast Ambient Occlusion Samuli Laine and Tero Karras NVIDIA Research.
Occlusion Culling Fall 2003 Ref: GamasutraGamasutra.
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
Visibility Culling using Hierarchical Occlusion Maps Hansong Zhang, Dinesh Manocha, Tom Hudson, Kenneth E. Hoff III Presented by: Chris Wassenius.
Object-Space Visibility Culling Anthony Steed University College London Based upon material presented by Claudio T. Silva at Eurographics 1999 Slides,
Real-Time Rendering SPEACIAL EFFECTS Lecture 03 Marina Gavrilova.
黃聰賢. Light Position Mesh Polygon Shadow Polygon  Clear color buffer and stencil buffer  Render the scene with ambient only.
Rasterization and Ray Tracing in Real-Time Applications (Games) Andrew Graff.
Practical and Robust Stenciled Shadow Volumes for Hardware-Accelerated Rendering Cass Everitt and Mark J. Kilgard Speaker: Alvin Date: 5/28/2003 NVIDIA.
Shadow Silhouette Maps Pradeep Sen Mike Cammarano Pat Hanrahan Stanford University Speaker: Alvin Date: 8/24/2003 SIGGRAPH 2003.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Quick-VDR: Interactive View-Dependent Rendering of Massive Models Sung-Eui Yoon Brian Salomon Russell Gayle.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
A Geometry-based Soft Shadow Volume Algorithm using Graphics Hardware Speaker: Alvin Date:2003/7/23 SIGGRAPH 2003 Ulf Assarsson Tomas Akenine-Moller.
Parallel Occlusion Culling for Interactive Walkthrough using Multiple GPUs Naga K Govindaraju, Avneesh Sud, Sun-Eui Yoon, Dinesh Manocha University of.
Final Gathering on GPU Toshiya Hachisuka University of Tokyo Introduction Producing global illumination image without any noise.
Shadow Volumes on Programmable Graphics Hardware Speaker: Alvin Date: 2003/11/3 EUROGRAPHICS 2003.
1 Dynamic Shadows and Lighting for Walkthrus of Large Models Brandon Lloyd COMP 258 December 2002.
Perspective Shadow Maps Marc Stamminger and George Drettakis Speaker: Alvin Date: 5/28/2003 SIGGRAPH 2002.
Shadow Algorithms Gerald Matzka Computer Science Seminar.
Approximate Soft Shadows on Arbitrary Surfaces using Penumbra Wedges Tomas Akenine-Möller Ulf Assarsson Department of Computer Engineering, Chalmers University.
Penumbra Maps: Approximate Soft Shadows in Real-Time Chris Wyman and Charles Hansen University of Utah Speaker: Alvin Date: 9/29/2003 EUROGRAPH 2003.
1 From-Point Occlusion Culling From-Point Occlusion Culling Chapter 23.
1 A Novel Page-Based Data Structure for Interactive Walkthroughs Behzad Sajadi Yan Huang Pablo Diaz-Gutierrez Sung-Eui Yoon M. Gopi.
1 A Hierarchical Shadow Volume Algorithm Timo Aila 1,2 Tomas Akenine-Möller 3 1 Helsinki University of Technology 2 Hybrid Graphics 3 Lund University.
Hidden Surface Removal
1 Occlusion Culling ©Yiorgos Chrysanthou, , Anthony Steed, 2004.
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.
Shadow Algorithms Ikrima Elhassan.
Ray Tracing Primer Ref: SIGGRAPH HyperGraphHyperGraph.
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
The Visibility Problem In many environments, most of the primitives (triangles) are not visible most of the time –Architectural walkthroughs, Urban environments.
Rendering Forest Scenes in Real-Time EGSR 2004 Philippe Decaudin Fabrice Neyret GRAVIR/IMAG-INRIA, Grenoble, France.
Computer Graphics 2 Lecture 8: Visibility Benjamin Mora 1 University of Wales Swansea Pr. Min Chen Dr. Benjamin Mora.
Advanced Computer Graphics Depth & Stencil Buffers / Rendering to Textures CO2409 Computer Graphics Week 19.
Real-Time Rendering SPEEDING UP RENDERING Lecture 04 Marina Gavrilova.
1 Introduction to Computer Graphics with WebGL Ed Angel Professor Emeritus of Computer Science Founding Director, Arts, Research, Technology and Science.
Quick-CULLIDE: Efficient Inter- and Intra- Object Collision Culling using Graphics Hardware Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha University.
Interactive Geometric Computations using Graphics Processors Naga K. Govindaraju UNC Chapel Hill.
Real-time Graphics for VR Chapter 23. What is it about? In this part of the course we will look at how to render images given the constrains of VR: –we.
Hardware-accelerated Rendering of Antialiased Shadows With Shadow Maps Stefan Brabec and Hans-Peter Seidel Max-Planck-Institut für Informatik Saarbrücken,
1 Visiblity: Culling and Clipping Computer Graphics COMP 770 (236) Spring 2009 January 21 & 26: 2009.
Sample Based Visibility for Soft Shadows using Alias-free Shadow Maps Erik Sintorn – Ulf Assarsson – uffe.
Hierarchical Penumbra Casting Samuli Laine Timo Aila Helsinki University of Technology Hybrid Graphics, Ltd.
Global Illumination. Local Illumination  the GPU pipeline is designed for local illumination  only the surface data at the visible point is needed to.
Graphics Interface 2009 The-Kiet Lu Kok-Lim Low Jianmin Zheng 1.
Real-Time Relief Mapping on Arbitrary Polygonal Surfaces Fabio Policarpo Manuel M. Oliveira Joao L. D. Comba.
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.
CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Presented by Marcus Parker By Naga K. Govindaraju,
1 Shadow Rendering Techniques: Hard and Soft Author: Jamiur Rahman Supervisor: Mushfiqur Rouf Department of CSE BRAC University.
01/28/09Dinesh Manocha, COMP770 Visibility Computations Visible Surface Determination Visibility Culling.
Graphics, Modeling, and Textures Computer Game Design and Development.
APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.
SHADOW CASTER CULLING FOR EFFICIENT SHADOW MAPPING JIŘÍ BITTNER 1 OLIVER MATTAUSCH 2 ARI SILVENNOINEN 3 MICHAEL WIMMER 2 1 CZECH TECHNICAL UNIVERSITY IN.
Shuen-Huei Guan Seminar in CMLab, NTU
Real-Time Soft Shadows with Adaptive Light Source Sampling
3D Graphics Rendering PPT By Ricardo Veguilla.
The Graphics Rendering Pipeline
Hybrid Ray Tracing of Massive Models
Graphics, Modeling, and Textures
ATO Project: Year 3 Main Tasks
Presentation transcript:

Interactive Shadow Generation in Complex Environments Naga K. Govindaraju, Brandon Lloyd, Sung-Eui Yoon, Avneesh Sud, Dinesh Manocha Speaker: Alvin Date: 2003/7/2 SIGGRAPH 2003

Alivn/GAME LAB/CSIE/NDHU 2 Interactive Shadow Generation in Complex Environments Outline Introduction Introduction LOD-based Interactive PVS Computation LOD-based Interactive PVS Computation Hybrid Shadow Generation Algorithm Hybrid Shadow Generation Algorithm Result Result Conclusion Conclusion

Alivn/GAME LAB/CSIE/NDHU 3 Interactive Shadow Generation in Complex Environments Introduction Produce hard-edged shadow. Produce hard-edged shadow. A hybrid approach. A hybrid approach. The efficiencies of image-precision techniques. (Shadow Map) The efficiencies of image-precision techniques. (Shadow Map) The image quality of object-space methods. (Shadow Volume) The image quality of object-space methods. (Shadow Volume) A interactive algorithm based on LOD and VC to compute PVS. A interactive algorithm based on LOD and VC to compute PVS. A novel cross-visibility culling algorithm. A novel cross-visibility culling algorithm. LOD-selection that avoid the artifacts in self-shadow. LOD-selection that avoid the artifacts in self-shadow. In a three PC system. In a three PC system.

Alivn/GAME LAB/CSIE/NDHU 4 Interactive Shadow Generation in Complex Environments Outline Introduction Introduction LOD-based Interactive PVS Computation LOD-based Interactive PVS Computation Hybrid Shadow Generation Algorithm Hybrid Shadow Generation Algorithm Result Result Conclusion Conclusion

Alivn/GAME LAB/CSIE/NDHU 5 Interactive Shadow Generation in Complex Environments LOD-based Interactive PVS Computation Key Words Key Words Scene Graph Representation Scene Graph Representation Occlusion Culling Occlusion Culling Problems Problems

Alivn/GAME LAB/CSIE/NDHU 6 Interactive Shadow Generation in Complex Environments Key Words PVS – Potentially Visible Set. PVS – Potentially Visible Set. PVS E – The PVS from the eye-view. PVS E – The PVS from the eye-view. PVS L – The PVS from the light-view. PVS L – The PVS from the light-view. HLOD – Hierarchical Levels-Of-Detail. HLOD – Hierarchical Levels-Of-Detail.

Alivn/GAME LAB/CSIE/NDHU 7 Interactive Shadow Generation in Complex Environments Scene Graph Representation Each node stores references to its children and to its bounding box.

Alivn/GAME LAB/CSIE/NDHU 8 Interactive Shadow Generation in Complex Environments Occlusion Culling Computing Occlusion Representation (OR) Computing Occlusion Representation (OR) Render the PVS from the previous frame but based on the current camera location. Render the PVS from the previous frame but based on the current camera location. Generate a depth map. Generate a depth map. Scene Graph Culling (SGC) Scene Graph Culling (SGC) Given the OR to use OQ. Object Culling – LOD selection. Object Culling – LOD selection. Sub-object Culling – Visible sub-object at the leaf node are added to PVS. Sub-object Culling – Visible sub-object at the leaf node are added to PVS.

Alivn/GAME LAB/CSIE/NDHU 9 Interactive Shadow Generation in Complex Environments Problems Inaccuracy in Shadow Boundaries Inaccuracy in Shadow Boundaries When the distance between a shadow-caster and a shadow- receiver is increased. When the distance between a shadow-caster and a shadow- receiver is increased. When the angle between the shadow-receiver ’ s normal and the light source direction almost 90 o. When the angle between the shadow-receiver ’ s normal and the light source direction almost 90 o. Self-Shadows Self-Shadows Ensure that LOD L is the same as LOD E for objects visible in both the views. Ensure that LOD L is the same as LOD E for objects visible in both the views.

Alivn/GAME LAB/CSIE/NDHU 10 Interactive Shadow Generation in Complex Environments Problems Recomputing PVSL Recomputing PVSL When the user move, LODE can change. When the user move, LODE can change. Need to compute PVSL to avoid self- shadows and popping in the final image. Need to compute PVSL to avoid self- shadows and popping in the final image.

Alivn/GAME LAB/CSIE/NDHU 11 Interactive Shadow Generation in Complex Environments Outline Introduction Introduction LOD-based Interactive PVS Computation LOD-based Interactive PVS Computation Hybrid Shadow Generation Algorithm Hybrid Shadow Generation Algorithm Result Result Conclusion Conclusion

Alivn/GAME LAB/CSIE/NDHU 12 Interactive Shadow Generation in Complex Environments Hybrid Shadow Generation Algorithm Cross Culling Cross Culling Shadow Generation Shadow Generation Architecture of The Process-Parallel Algorithm. Architecture of The Process-Parallel Algorithm. Frame Work Frame Work

Alivn/GAME LAB/CSIE/NDHU 13 Interactive Shadow Generation in Complex Environments Cross Culling Partitions the PVS E into three subsets. Partitions the PVS E into three subsets. Fully-lighted (FV) Fully-lighted (FV) Fully-shadowed receivers (SR F ) Fully-shadowed receivers (SR F ) Partially-shadowed receivers (SR P ) Partially-shadowed receivers (SR P ) Proceeds in two step. Proceeds in two step. Based on OQ, partitions PVS E into FV, SR F, SR P. Based on OQ, partitions PVS E into FV, SR F, SR P. Cull away those in PVS L but do not cast a shadow on SR P. The remaining, SC, are used for shadow generation. Cull away those in PVS L but do not cast a shadow on SR P. The remaining, SC, are used for shadow generation.

Alivn/GAME LAB/CSIE/NDHU 14 Interactive Shadow Generation in Complex Environments Shadow Generation SR P are clipped against the shadow frusta formed by SC. SR P are clipped against the shadow frusta formed by SC. The resulting shadow-polygons are calculated by repeatedly clipping the scene triangles against the planes of the shadow frusta. The resulting shadow-polygons are calculated by repeatedly clipping the scene triangles against the planes of the shadow frusta.

Alivn/GAME LAB/CSIE/NDHU 15 Interactive Shadow Generation in Complex Environments Rendering The shadow are rendered in two passes: The shadow are rendered in two passes: SR F and SR P are rendered with only ambient lighting. The shadowed polygons are rendered to the stencil buffer with the depth test enabled. SR F and SR P are rendered with only ambient lighting. The shadowed polygons are rendered to the stencil buffer with the depth test enabled. SR P and FV are rendered with full lighting using the stencil test to prevent writing in the shadowed regions. SR P and FV are rendered with full lighting using the stencil test to prevent writing in the shadowed regions.

Alivn/GAME LAB/CSIE/NDHU 16 Interactive Shadow Generation in Complex Environments Architecture of The Process-Parallel Algorithm

Alivn/GAME LAB/CSIE/NDHU 17 Interactive Shadow Generation in Complex Environments Frame Work

Alivn/GAME LAB/CSIE/NDHU 18 Interactive Shadow Generation in Complex Environments Outline Introduction Introduction LOD-based Interactive PVS Computation LOD-based Interactive PVS Computation Hybrid Shadow Generation Algorithm Hybrid Shadow Generation Algorithm Result Result Conclusion Conclusion

Alivn/GAME LAB/CSIE/NDHU 19 Interactive Shadow Generation in Complex Environments Result Experiment Environment Experiment Environment Performance Performance Snapshot Snapshot Demo Demo

Alivn/GAME LAB/CSIE/NDHU 20 Interactive Shadow Generation in Complex Environments Experiment Environment On 3 Dell Precision workstations. On 3 Dell Precision workstations. With dual 1.8 GHz pentium CPUs With dual 1.8 GHz pentium CPUs 2 GB of main memory 2 GB of main memory A NVIDIA GeForce-4 Ti 4600 GPU A NVIDIA GeForce-4 Ti 4600 GPU Allocate 72MB out of 128MB on each GPU to store the vertices of objects, sub-objects, and bounding boxes. Allocate 72MB out of 128MB on each GPU to store the vertices of objects, sub-objects, and bounding boxes. Use Vertex Arrays and OQ. Use Vertex Arrays and OQ.

Alivn/GAME LAB/CSIE/NDHU 21 Interactive Shadow Generation in Complex Environments Performance

Alivn/GAME LAB/CSIE/NDHU 22 Interactive Shadow Generation in Complex Environments Snapshot

Alivn/GAME LAB/CSIE/NDHU 23 Interactive Shadow Generation in Complex Environments Snapshot

Alivn/GAME LAB/CSIE/NDHU 24 Interactive Shadow Generation in Complex Environments Snapshot

Alivn/GAME LAB/CSIE/NDHU 25 Interactive Shadow Generation in Complex Environments Snapshot

Alivn/GAME LAB/CSIE/NDHU 26 Interactive Shadow Generation in Complex Environments Demo

Alivn/GAME LAB/CSIE/NDHU 27 Interactive Shadow Generation in Complex Environments Outline Introduction Introduction LOD-based Interactive PVS Computation LOD-based Interactive PVS Computation Hybrid Shadow Generation Algorithm Hybrid Shadow Generation Algorithm Result Result Conclusion Conclusion

Alivn/GAME LAB/CSIE/NDHU 28 Interactive Shadow Generation in Complex Environments Conclusion Generate hard-edge shadow. Generate hard-edge shadow. Reduce the aliasing artifact that are present in pure image-precision approaches. Reduce the aliasing artifact that are present in pure image-precision approaches. Present an improved algorithm for PVS computation. Present an improved algorithm for PVS computation. The Cross-culling algorithm can accelerate the performance of a pure shadow volume approach The Cross-culling algorithm can accelerate the performance of a pure shadow volume approach

Alivn/GAME LAB/CSIE/NDHU 29 Interactive Shadow Generation in Complex Environments Thanks for your attention!