Ray Tracing Dynamic Scenes using Selective Restructuring Sung-eui Yoon Sean Curtis Dinesh Manocha Univ. of North Carolina at Chapel Hill Lawrence Livermore.

Slides:



Advertisements
Similar presentations
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware.
Advertisements

Sven Woop Computer Graphics Lab Saarland University
Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.
Ray Tracing Ray Tracing 1 Basic algorithm Overview of pbrt Ray-surface intersection (triangles, …) Ray Tracing 2 Brute force: Acceleration data structures.
Two-Level Grids for Ray Tracing on GPUs
Week 14 - Monday.  What did we talk about last time?  Bounding volume/bounding volume intersections.
RT06 conferenceVlastimil Havran On the Fast Construction of Spatial Hierarchies for Ray Tracing Vlastimil Havran 1,2 Robert Herzog 1 Hans-Peter Seidel.
Proximity Computations between Noisy Point Clouds using Robust Classification 1 Jia Pan, 2 Sachin Chitta, 1 Dinesh Manocha 1 UNC Chapel Hill 2 Willow Garage.
FASTCD: Fracturing-Aware Stable Collision Detection Jae-Pil Heo 1, Joon-Kyung Seong 1, Duksu Kim 1, Miguel A. Otaduy 2, Jeong-Mo Hong 3, Min Tang 4, and.
Cost-based Workload Balancing for Ray Tracing on a Heterogeneous Platform Mario Rincón-Nigro PhD Showcase Feb 17 th, 2012.
Afrigraph 2004 Interactive Ray-Tracing of Free-Form Surfaces Carsten Benthin Ingo Wald Philipp Slusallek Computer Graphics Lab Saarland University, Germany.
Ray Tracing Acceleration Structures Solomon Boulos 4/16/2004.
GPU Proximity Queries with Swept Sphere Volumes COMP Robotics Project Proposal Qi Mo.
RT 08 Efficient Clustered BVH Update Algorithm for Highly-Dynamic Models Symposium on Interactive Ray Tracing 2008 Los Angeles, California Kirill Garanzha.
GH05 KD-Tree Acceleration Structures for a GPU Raytracer Tim Foley, Jeremy Sugerman Stanford University.
Specialized Acceleration Structures for Ray-Tracing Warren Hunt Bill Mark.
Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.
Overview Class #10 (Feb 18) Assignment #2 (due in two weeks) Deformable collision detection Some simulation on graphics hardware... –Thursday: Cem Cebenoyan.
Dynamic Maintenance and Self Collision Testing for Large Kinematic Chains Lotan, Schwarzer, Halperin, Latombe.
CS 326 A: Motion Planning robotics.stanford.edu/~latombe/cs326/2004/index.htm Collision Detection and Distance Computation.
R-LODs: Fast LOD-based Ray Tracing of Massive Models Sung-Eui Yoon Lawrence Livermore National Lab. Christian Lauterbach Dinesh Manocha Univ. of North.
Bounding Volume Hierarchies and Spatial Partitioning Kenneth E. Hoff III COMP-236 lecture Spring 2000.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Collision Detection for Deformable Objects Xin Huang 16/10/2007.
Fast Agglomerative Clustering for Rendering Bruce Walter, Kavita Bala, Cornell University Milind Kulkarni, Keshav Pingali University of Texas, Austin.
1 Advanced Scene Management System. 2 A tree-based or graph-based representation is good for 3D data management A tree-based or graph-based representation.
Hybrid Bounding Volumes for Distance Queries Distance Query returns the minimum distance between two geometric models Major application is path planning.
RT08, August ‘08 Large Ray Packets for Real-time Whitted Ray Tracing Ryan Overbeck Columbia University Ravi Ramamoorthi Columbia University William R.
Collision Detection David Johnson Cs6360 – Virtual Reality.
Efficient Maintenance and Self-Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Data Management Techniques Sung-Eui Yoon KAIST URL:
H IGH P ERFORMANCE R AY T RACING Keqing Chen Yihan Sun Xinran Xu.
Efficient Maintenance and Self- Collision Testing for Kinematic Chains Itay Lotan Fabian Schwarzer Dan Halperin Jean-Claude Latombe.
Fast Collision Detection for Deformable Models using Representative-Triangles Sean Curtis 1, Rasmus Tamstorf 2, & Dinesh Manocha 1 I3D 2008 February 15,
Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,
Stefan PopovHigh Performance GPU Ray Tracing Real-time Ray Tracing on GPU with BVH-based Packet Traversal Stefan Popov, Johannes Günther, Hans- Peter Seidel,
On a Few Ray Tracing like Algorithms and Structures. -Ravi Prakash Kammaje -Swansea University.
By Mahmoud Moustafa Zidan Basic Sciences Department Faculty of Computer and Information Sciences Ain Shams University Under Supervision of Prof. Dr. Taymoor.
An Evaluation of Existing BVH Traversal Algorithms for Efficient Multi-Hit Ray Tracing Jefferson Amstutz (SURVICE) Johannes Guenther (Intel) Ingo Wald.
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies Tae-Joon Kim Bochang Moon Duksu Kim Sung-Eui Yoon KAIST (Korea Advanced Institute of.
Quick-CULLIDE: Efficient Inter- and Intra- Object Collision Culling using Graphics Hardware Naga K. Govindaraju, Ming C. Lin, Dinesh Manocha University.
Institute of C omputer G raphics, TU Braunschweig Hybrid Scene Structuring with Application to Ray Tracing 24/02/1999 Gordon Müller, Dieter Fellner 1 Hybrid.
Random-Accessible Compressed Triangle Meshes Sung-eui Yoon Korea Advanced Institute of Sci. and Tech. (KAIST) Peter Lindstrom Lawrence Livermore National.
Saarland University, Germany B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes Sven Woop Gerd Marmitt Philipp Slusallek.
Collision and Proximity Queries Dinesh Manocha Department of Computer Science University of North Carolina
Click to edit Master title style HCCMeshes: Hierarchical-Culling oriented Compact Meshes Tae-Joon Kim 1, Yongyoung Byun 1, Yongjin Kim 2, Bochang Moon.
Fast BVH Construction on GPUs (Eurographics 2009) Park, Soonchan KAIST (Korea Advanced Institute of Science and Technology)
Supporting Animation and Interaction Ingo Wald SCI Institute, University of Utah
David Luebke11/26/2015 CS 551 / 645: Introductory Computer Graphics David Luebke
Hierarchical Penumbra Casting Samuli Laine Timo Aila Helsinki University of Technology Hybrid Graphics, Ltd.
Dynamic Scenes Paul Arthur Navrátil ParallelismJustIsn’tEnough.
Ray Tracing Animated Scenes using Motion Decomposition Johannes Günther, Heiko Friedrich, Ingo Wald, Hans-Peter Seidel, and Philipp Slusallek.
Interactive Ray Tracing of Dynamic Scenes Tomáš DAVIDOVIČ Czech Technical University.
Stable 6-DOF Haptic Rendering with Inner Sphere Trees René Weller, Gabriel Zachmann Clausthal University, Germany IDETC/CIE.
Maximizing Parallelism in the Construction of BVHs, Octrees, and k-d Trees Tero Karras NVIDIA Research.
Presented by Paul Phipps
Compact, Fast and Robust Grids for Ray Tracing Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday, June 25th.
Compact, Fast and Robust Grids for Ray Tracing
Ray Tracing Optimizations
Ray Tracing Acceleration (5). Ray Tracing Acceleration Techniques Too Slow! Uniform grids Spatial hierarchies K-D Octtree BSP Hierarchical grids Hierarchical.
Path/Ray Tracing Examples. Path/Ray Tracing Rendering algorithms that trace photon rays Trace from eye – Where does this photon come from? Trace from.
UNC Chapel Hill David A. O’Brien Automatic Simplification of Particle System Dynamics David O’Brien Susan Fisher Ming C. Lin Department of Computer Science.
1 The Method of Precomputing Triangle Clusters for Quick BVH Builder and Accelerated Ray Tracing Kirill Garanzha Department of Software for Computers Bauman.
Fast Collision Detection for Deformable Models using Representative-Triangles Presented by Marcus Parker By Sean Curtis, Rasmus Tamstorf and Dinesh Manocha.
Hybrid Ray Tracing and Path Tracing of Bezier Surfaces using a mixed hierarchy Rohit Nigam, P. J. Narayanan CVIT, IIIT Hyderabad, Hyderabad, India.
Optimized Continuous Collision Detection for Deformable Triangle Meshes Marco Hutter and Arnulph Fuhrmann WCSG’2007 – 30 January, 2007 – Plzen,
Two-Level Grids for Ray Tracing on GPUs
Real-Time Ray Tracing Stefan Popov.
Hybrid Ray Tracing of Massive Models
Cache-Efficient Layouts of BVHs and Meshes
Collision Detection.
Presentation transcript:

Ray Tracing Dynamic Scenes using Selective Restructuring Sung-eui Yoon Sean Curtis Dinesh Manocha Univ. of North Carolina at Chapel Hill Lawrence Livermore National Lab

Motivations l Dynamic scenes are widely used n Movies, VR applications, and games l Complex and large dynamic scenes n E.g, high-resolution explosion, tears, and fractures

An Example of Exploding Dragon (252K triangles)

Ray Tracing Dynamic Scenes l Acceleration hierarchy construction n e.g., kd-trees, bounding volume hierarchies, grids, etc l Hierarchy traversal n Perform ray-triangle intersection tests l Key issue n Update the hierarchy as triangles deform

Bounding Volume Hierarchies (BVH) based Ray Tracing l Employed early in [Whitted 80] n kd-trees and grids became popular for static models in 90’s l Recently get renewed interest in ray tracing dynamic scenes [Wald et al. 07, Lauterbach et al. 07, Larsson et al. 03] n Simple, but efficient BVH update method is available n Can have better performance

BVHs l Object partitioning hierarchies n Uses axis-aligned bounding boxes n Considers surface-area heuristic (SAH) [Goldsmith and Salmon 87] A BVH

Two BVH Update Methods Frame 1 Frame 2 BV refitting BV reconstruction O(n log n) O(n log n) Good-quality BVs Good-quality BVs O(n) O(n) Poor-quality BVs Poor-quality BVs

Our Goal l Existing BVH update methods n Work at particular classes of dynamic scenes l Design a robust BVH update method n Works well with wide classes of dynamic scenes n Improves the performance of ray tracing

Our Contributions l Proposes a novel algorithm to selectively restructure BVHs n Selective restructuring operations n Two probabilistic metrics: culling efficiency and restructuring benefit BVH Restructure Refit

Example of Exploding Dragon Model BV refitting Complete reconstruction # of intersections Ray tracing time (sec): construction + traversal Selective restructuring

Runtime Captured Video – BART Model (65K triangles) l Compared with the BV refitting method Enabled primary & shadow rays Single thread

Prior Hybrid BVH Update Methods l Based on simple heuristics n RT-Deform [Lauterbach et al. 06] n LM method [Larsson and Akenine-Möller 06] l Hard to see what dynamic scenarios they work with or not

Runtime Captured Video – BART Model l Compared with RT-Deform Single thread

Probabilistic BVH Metrics for Ray Tracing l Culling efficiency n Quantifies the quality of any sub-BVHs n Measures the expected # of intersection tests for a ray l Restructuring benefit n Predicts the performance improvement n Measures improved culling efficiency when restructuring sub-BVHs

Major Observation l Restructuring two nodes with BV overlaps can improve the culling efficiency n Assumes that restructuring operation will remove all the BV overlaps A BVH

Selective Restructuring Operations

Overall Framework l At a new frame n Refits BVs with deformed triangles n Performs our selective restructuring algorithm n Runs BVH-based ray tracing

Detecting BV Overlaps l Brute-force method n Requires O(m 2 ) where m is # of BVs l Hierarchical traversal and culling n Inspired by efficient collision detection methods

Overview of Selective Restructuring Algorithm l Computes restructuring candidates n Detects nodes with BV overlaps during hierarchy traversal l Restructure node pairs with higher restructuring benefits greedily n Improves the performance of ray tracing

Evaluating Our Algorithm l Implement BVH-based ray tracer [Lauterbach et al. 06] n Tests with four dynamic scenes having different characteristics

Dynamic Scenes l Cloth simulation (92K)

Dynamic Scenes l N-body simulation (146K)

Dynamic Scenes l Exploding dragon (252K) l BART (65K)

Prior Works l BV Refitting [Wald et al. 07, Bergen 97] l Complete re-construction from scratch l RT-Deform [Lauterbach et al. 06] l LM method [Larsson and Akenine-Möller 06]

Performance Improvement Ratio Complete re-construction Exploding dragon 8.5 N-body simulation 1.8 BART1.1 Cloth simulation 4.7 Refitting only 11 >

Image Shots from Cloth Simulation

Performance Improvement Ratio Complete const. Refitting only Exploding dragon N-body simulation 1.8> 80 BART Cloth simulation Robust performance improvement across our benchmarks RT- Deform LM method

Conclusions l Novel algorithm to selectively restructure BVHs n Based on selective restructuring operations and two BVH metrics n Has more robustness and deals with bigger scene complexity n Can be used in other applications l Dynamic scenes are available

Acknowledgements l Naga Govindaraju l Christian Lauterbach l Ingo Wald l Ming Jang l Hanan Samet l Peter Lindstrom l Other members of data analysis group l Anonymous reviewers l Our funding agencies