Holger Dammertz August 10, The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz, Alexander Keller
|
|
|
- Rolf Moody
- 5 years ago
- Views:
Transcription
1 Holger Dammertz August 10, 2008 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz, Alexander Keller
2 Page 2 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Introduction Disadvantage of Object Partioning using Bounding Volumes Bounding volume does not pack primitives perfectly Primitves are of varying size The result is overlap of tree nodes and children wasting traversal time
3 Page 2 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Introduction Disadvantage of Object Partioning using Bounding Volumes Bounding volume does not pack primitives perfectly Primitves are of varying size The result is overlap of tree nodes and children wasting traversal time
4 Page 2 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Introduction Disadvantage of Object Partioning using Bounding Volumes Bounding volume does not pack primitives perfectly Primitves are of varying size The result is overlap of tree nodes and children wasting traversal time Advantage of Bounding Volume Hierachies Easy and fast traversal Memory behaviour deterministic and controllable Very small acceleration structures possible
5 Page 3 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Splitting Early Split Clipping Approach Presented last year on RT07 Based on surface area of triangles Split each triangle at axis aligned plane Good performance with correct parameters
6 Page 3 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Splitting Early Split Clipping Approach Presented last year on RT07 Based on surface area of triangles Split each triangle at axis aligned plane Good performance with correct parameters by ingenious - OMPF Forum There is no good global early clipping heuristic. Try presplitting the triangles in Soda Hall - unless you re a magician and just guess the correct splitting threshold, you ll end up with out of memory exception during tree building :D
7 Page 4 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Hand Tweaking may be difficult Problems of Early Split Clipping Memory consumption unpredictable Clipping against planes may introduce numerical problems May split many triangles without any speed improvement
8 Page 4 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Hand Tweaking may be difficult Problems of Early Split Clipping Memory consumption unpredictable Clipping against planes may introduce numerical problems May split many triangles without any speed improvement Animations Many different shots Scene complexity may change during a shot
9 Page 4 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Hand Tweaking may be difficult Problems of Early Split Clipping Memory consumption unpredictable Clipping against planes may introduce numerical problems May split many triangles without any speed improvement Animations Many different shots Scene complexity may change during a shot Advantages of creating smaller triangles Basic principle similar to kd reference duplication Controllable which triangles to split Preprocess before tree construction
10 Page 5 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Our Approach Preserve advantage of BVH Small memory consumption - split only really bad triangles Numerically robust and consistent Fast Automatic for normal scenes
11 Page 5 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Our Approach Preserve advantage of BVH Small memory consumption - split only really bad triangles Numerically robust and consistent Fast Automatic for normal scenes Observation Not all large triangles are bad, espacially in architectural scenes Large triangles are often axis aligned and form quads These triangles are no huge problem in SAH based tree construction
12 Page 6 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Subdivision Reduce overlap Triangle Subdivision at edge midpoint also reduces overlap
13 Page 6 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Subdivision Reduce overlap Triangle Subdivision at edge midpoint also reduces overlap
14 Page 6 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Subdivision Reduce overlap Triangle Subdivision at edge midpoint also reduces overlap Edge Volume Heuristic Split a triangle if volume of AABB of a triangle edge exceeds threshold ε v (t). Use midpoint of edge for split A+B 2 is numerically very robust Adjacent triangles sharing an edge are split at the same point Watertight Subdivision: a consistent mesh stays consistent Each triangle is independent
15 Page 7 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Subdivision Edge AABB Volume Axis aligned edges have no AABB volume Very economic splitting: only very bad triangles are split Choice of Threshold Global Threshold based on full scene AABB volume V ε v (t) := V 2 t Use t = 14 as default value. Over a broad range of scenes a very good default value Less than 1% of reference duplication in already fast scenes
16 Page 8 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Implementation Details Preprocess Before ray tracing by scene exporter Larger memory consumption Transparent for underlying ray tracer
17 Page 8 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Implementation Details Preprocess Before ray tracing by scene exporter Larger memory consumption Transparent for underlying ray tracer On demand Compute only bounding boxes prior to tree construction Memory efficient (only replicated indices needed) Transparent for user Pre-Scan is efficient
18 Page 8 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Implementation Details Preprocess Before ray tracing by scene exporter Larger memory consumption Transparent for underlying ray tracer On demand Compute only bounding boxes prior to tree construction Memory efficient (only replicated indices needed) Transparent for user Pre-Scan is efficient Additional optimization BVH has usually more than one triangle per leaf Remove duplicates
19 Page 9 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Results - Static Scenes Bunny, Buddha, Dragon... No triangles are split
20 Page 10 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Results - Static Scenes Space Ship # Triangles % Render Time % 100 Percentage Threshold
21 Page 11 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Results - Static Scenes Rotated Kitchen # Triangles % Render Time % Percentage Threshold
22 Page 12 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Results - Simple Animation Rotated Sponza - Performance Statistics Base Threshold 12 Threshold 14 Threshold Frame Time (ms) Frame Nr.
23 Page 13 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Results - Simple Animation Rotated Sponza - Triangle Statistics Base Threshold 12 Threshold 14 Threshold Number of Triangel References Frame Nr.
24 Page 14 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Summary Economical heuristic to subdivide triangles Efficiently reduces the overlap of triangles Numerically robust and topology unaware preprocess Simple global threshold Acknowledgements mental images GmbH for support and funding of this research
25 Page 14 The Edge Volume Heuristic Robust Triangle Subdivision for Improved BVH Performance Holger Dammertz August 10, 2008 Summary Economical heuristic to subdivide triangles Efficiently reduces the overlap of triangles Numerically robust and topology unaware preprocess Simple global threshold Acknowledgements mental images GmbH for support and funding of this research Questions?
MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur
MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur Leonhard Grünschloß Martin Stich Sehera Nawaz Alexander Keller August 6, 2011 Principles of Accelerated Ray Tracing Hierarchical
Ray Tracing Acceleration. CS 4620 Lecture 20
Ray Tracing Acceleration CS 4620 Lecture 20 2013 Steve Marschner 1 Will this be on the exam? or, Prelim 2 syllabus You can expect emphasis on topics related to the assignment (Shaders 1&2) and homework
Topics. Ray Tracing II. Intersecting transformed objects. Transforming objects
Topics Ray Tracing II CS 4620 Lecture 16 Transformations in ray tracing Transforming objects Transformation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies
Acceleration Data Structures
CT4510: Computer Graphics Acceleration Data Structures BOCHANG MOON Ray Tracing Procedure for Ray Tracing: For each pixel Generate a primary ray (with depth 0) While (depth < d) { Find the closest intersection
Topics. Ray Tracing II. Transforming objects. Intersecting transformed objects
Topics Ray Tracing II CS 4620 ations in ray tracing ing objects ation hierarchies Ray tracing acceleration structures Bounding volumes Bounding volume hierarchies Uniform spatial subdivision Adaptive spatial
Accelerated Raytracing
Accelerated Raytracing Why is Acceleration Important? Vanilla ray tracing is really slow! mxm pixels, kxk supersampling, n primitives, average ray path length of d, l lights, 2 recursive ray casts per
Improving Memory Space Efficiency of Kd-tree for Real-time Ray Tracing Byeongjun Choi, Byungjoon Chang, Insung Ihm
Improving Memory Space Efficiency of Kd-tree for Real-time Ray Tracing Byeongjun Choi, Byungjoon Chang, Insung Ihm Department of Computer Science and Engineering Sogang University, Korea Improving Memory
INFOGR Computer Graphics. J. Bikker - April-July Lecture 11: Acceleration. Welcome!
INFOGR Computer Graphics J. Bikker - April-July 2015 - Lecture 11: Acceleration Welcome! Today s Agenda: High-speed Ray Tracing Acceleration Structures The Bounding Volume Hierarchy BVH Construction BVH
CPSC / Sonny Chan - University of Calgary. Collision Detection II
CPSC 599.86 / 601.86 Sonny Chan - University of Calgary Collision Detection II Outline Broad phase collision detection: - Problem definition and motivation - Bounding volume hierarchies - Spatial partitioning
SAH guided spatial split partitioning for fast BVH construction. Per Ganestam and Michael Doggett Lund University
SAH guided spatial split partitioning for fast BVH construction Per Ganestam and Michael Doggett Lund University Opportunistic triangle splitting for higher quality BVHs Bounding Volume Hierarchies (BVH)
Lecture 2 - Acceleration Structures
INFOMAGR Advanced Graphics Jacco Bikker - November 2017 - February 2018 Lecture 2 - Acceleration Structures Welcome! I x, x = g(x, x ) ε x, x + න S ρ x, x, x I x, x dx Today s Agenda: Problem Analysis
Ray Tracing Acceleration. CS 4620 Lecture 22
Ray Tracing Acceleration CS 4620 Lecture 22 2014 Steve Marschner 1 Topics Transformations in ray tracing Transforming objects Transformation hierarchies Ray tracing acceleration structures Bounding volumes
Homework 1: Implicit Surfaces, Collision Detection, & Volumetric Data Structures. Loop Subdivision. Loop Subdivision. Questions/Comments?
Homework 1: Questions/Comments? Implicit Surfaces,, & Volumetric Data Structures Loop Subdivision Shirley, Fundamentals of Computer Graphics Loop Subdivision SIGGRAPH 2000 course notes Subdivision for
Object Partitioning Considered Harmful: Space Subdivision for BVHs
Object Partitioning Considered Harmful: Space Subdivision for BVHs Stefan Popov Saarland University Iliyan Georgiev Saarland University Rossen Dimov Saarland University Philipp Slusallek DFKI Saarbrücken
Ray Tracing Acceleration Data Structures
Ray Tracing Acceleration Data Structures Sumair Ahmed October 29, 2009 Ray Tracing is very time-consuming because of the ray-object intersection calculations. With the brute force method, each ray has
Fast BVH Construction on GPUs
Fast BVH Construction on GPUs Published in EUROGRAGHICS, (2009) C. Lauterbach, M. Garland, S. Sengupta, D. Luebke, D. Manocha University of North Carolina at Chapel Hill NVIDIA University of California
Ray Tracing. Cornell CS4620/5620 Fall 2012 Lecture Kavita Bala 1 (with previous instructors James/Marschner)
CS4620/5620: Lecture 37 Ray Tracing 1 Announcements Review session Tuesday 7-9, Phillips 101 Posted notes on slerp and perspective-correct texturing Prelim on Thu in B17 at 7:30pm 2 Basic ray tracing Basic
Accelerating Geometric Queries. Computer Graphics CMU /15-662, Fall 2016
Accelerating Geometric Queries Computer Graphics CMU 15-462/15-662, Fall 2016 Geometric modeling and geometric queries p What point on the mesh is closest to p? What point on the mesh is closest to p?
Computer Graphics Ray Casting. Matthias Teschner
Computer Graphics Ray Casting Matthias Teschner Outline Context Implicit surfaces Parametric surfaces Combined objects Triangles Axis-aligned boxes Iso-surfaces in grids Summary University of Freiburg
Exploiting Local Orientation Similarity for Efficient Ray Traversal of Hair and Fur
1 Exploiting Local Orientation Similarity for Efficient Ray Traversal of Hair and Fur Sven Woop, Carsten Benthin, Ingo Wald, Gregory S. Johnson Intel Corporation Eric Tabellion DreamWorks Animation 2 Legal
Intersection Acceleration
Advanced Computer Graphics Intersection Acceleration Matthias Teschner Computer Science Department University of Freiburg Outline introduction bounding volume hierarchies uniform grids kd-trees octrees
Anti-aliased and accelerated ray tracing. University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell
Anti-aliased and accelerated ray tracing University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell Reading Required: Watt, sections 12.5.3 12.5.4, 14.7 Further reading: A. Glassner.
Announcements. Written Assignment2 is out, due March 8 Graded Programming Assignment2 next Tuesday
Announcements Written Assignment2 is out, due March 8 Graded Programming Assignment2 next Tuesday 1 Spatial Data Structures Hierarchical Bounding Volumes Grids Octrees BSP Trees 11/7/02 Speeding Up Computations
Computer Graphics. - Spatial Index Structures - Philipp Slusallek
Computer Graphics - Spatial Index Structures - Philipp Slusallek Overview Last lecture Overview of ray tracing Ray-primitive intersections Today Acceleration structures Bounding Volume Hierarchies (BVH)
Spatial Data Structures. Steve Rotenberg CSE168: Rendering Algorithms UCSD, Spring 2017
Spatial Data Structures Steve Rotenberg CSE168: Rendering Algorithms UCSD, Spring 2017 Ray Intersections We can roughly estimate the time to render an image as being proportional to the number of ray-triangle
Row Tracing with Hierarchical Occlusion Maps
Row Tracing with Hierarchical Occlusion Maps Ravi P. Kammaje, Benjamin Mora August 9, 2008 Page 2 Row Tracing with Hierarchical Occlusion Maps Outline August 9, 2008 Introduction Related Work Row Tracing
Ray-Box Culling for Tree Structures
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING XX, XXX-XXX (2012) Ray-Box Culling for Tree Structures JAE-HO NAH 1, WOO-CHAN PARK 2, YOON-SIG KANG 1, AND TACK-DON HAN 1 1 Department of Computer Science
Ray Intersection Acceleration
Ray Intersection Acceleration Image Synthesis Torsten Möller Reading Physically Based Rendering by Pharr&Humphreys Chapter 2 - rays and transformations Chapter 3 - shapes Chapter 4 - intersections and
Acceleration Data Structures for Ray Tracing
Acceleration Data Structures for Ray Tracing Travis Fischer and Nong Li (2007) Andries van Dam November 10, 2009 Acceleration Data Structures 1/35 Outline Introduction/Motivation Bounding Volume Hierarchy
Computer Graphics. Bing-Yu Chen National Taiwan University The University of Tokyo
Computer Graphics Bing-Yu Chen National Taiwan University The University of Tokyo Hidden-Surface Removal Back-Face Culling The Depth-Sort Algorithm Binary Space-Partitioning Trees The z-buffer Algorithm
Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring
Bounding Volume Hierarchy Optimization through Agglomerative Treelet Restructuring Leonardo R. Domingues Helio Pedrini Eldorado Research Institute Institute of Computing - University of Campinas Brazil
EFFICIENT BVH CONSTRUCTION AGGLOMERATIVE CLUSTERING VIA APPROXIMATE. Yan Gu, Yong He, Kayvon Fatahalian, Guy Blelloch Carnegie Mellon University
EFFICIENT BVH CONSTRUCTION VIA APPROXIMATE AGGLOMERATIVE CLUSTERING Yan Gu, Yong He, Kayvon Fatahalian, Guy Blelloch Carnegie Mellon University BVH CONSTRUCTION GOALS High quality: produce BVHs of comparable
Ray Tracing. Computer Graphics CMU /15-662, Fall 2016
Ray Tracing Computer Graphics CMU 15-462/15-662, Fall 2016 Primitive-partitioning vs. space-partitioning acceleration structures Primitive partitioning (bounding volume hierarchy): partitions node s primitives
Accelerated Entry Point Search Algorithm for Real-Time Ray-Tracing
Accelerated Entry Point Search Algorithm for Real-Time Ray-Tracing Figure 1: Four of the scenes used for testing purposes. From the left: Fairy Forest from the Utah 3D Animation Repository, Legocar from
Spatial Data Structures
CSCI 420 Computer Graphics Lecture 17 Spatial Data Structures Jernej Barbic University of Southern California Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees [Angel Ch. 8] 1 Ray Tracing Acceleration
The Minimal Bounding Volume Hierarchy
Vision, Modeling, and Visualization (2010) Reinhard Koch, Andreas Kolb, Christof Rezk-Salama (Eds.) The Minimal Bounding Volume Hierarchy Pablo Bauszat 1 and Martin Eisemann 1 and Marcus Magnor 1 1 TU
Efficient Clustered BVH Update Algorithm for Highly-Dynamic Models. Kirill Garanzha
Symposium on Interactive Ray Tracing 2008 Los Angeles, California Efficient Clustered BVH Update Algorithm for Highly-Dynamic Models Kirill Garanzha Department of Software for Computers Bauman Moscow State
Spatial Data Structures
CSCI 480 Computer Graphics Lecture 7 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids BSP Trees [Ch. 0.] March 8, 0 Jernej Barbic University of Southern California http://www-bcf.usc.edu/~jbarbic/cs480-s/
improving raytracing speed
ray tracing II computer graphics ray tracing II 2006 fabio pellacini 1 improving raytracing speed computer graphics ray tracing II 2006 fabio pellacini 2 raytracing computational complexity ray-scene intersection
Anti-aliased and accelerated ray tracing. University of Texas at Austin CS384G - Computer Graphics
Anti-aliased and accelerated ray tracing University of Texas at Austin CS384G - Computer Graphics Fall 2010 Don Fussell eading! equired:! Watt, sections 12.5.3 12.5.4, 14.7! Further reading:! A. Glassner.
SPATIAL DATA STRUCTURES. Jon McCaffrey CIS 565
SPATIAL DATA STRUCTURES Jon McCaffrey CIS 565 Goals Spatial Data Structures (Construction esp.) Why What How Designing Algorithms for the GPU Why Accelerate spatial queries Search problem Target Application
Accelerating Ray-Tracing
Lecture 9: Accelerating Ray-Tracing Computer Graphics and Imaging UC Berkeley CS184/284A, Spring 2016 Course Roadmap Rasterization Pipeline Core Concepts Sampling Antialiasing Transforms Geometric Modeling
Ray Tracing with Spatial Hierarchies. Jeff Mahovsky & Brian Wyvill CSC 305
Ray Tracing with Spatial Hierarchies Jeff Mahovsky & Brian Wyvill CSC 305 Ray Tracing Flexible, accurate, high-quality rendering Slow Simplest ray tracer: Test every ray against every object in the scene
SAH guided spatial split partitioning for fast BVH construction
EUROGRAPHICS 2016 / J. Jorge and M. Lin (Guest Editors) Volume 35 (2016), Number 2 SAH guided spatial split partitioning for fast BVH construction Per Ganestam and Michael Doggett Lund University Figure
Real Time Ray Tracing
Real Time Ray Tracing Programação 3D para Simulação de Jogos Vasco Costa Ray tracing? Why? How? P3DSJ Real Time Ray Tracing Vasco Costa 2 Real time ray tracing : example Source: NVIDIA P3DSJ Real Time
COMP 175: Computer Graphics April 11, 2018
Lecture n+1: Recursive Ray Tracer2: Advanced Techniques and Data Structures COMP 175: Computer Graphics April 11, 2018 1/49 Review } Ray Intersect (Assignment 4): questions / comments? } Review of Recursive
EDAN30 Photorealistic Computer Graphics. Seminar 2, Bounding Volume Hierarchy. Magnus Andersson, PhD student
EDAN30 Photorealistic Computer Graphics Seminar 2, 2012 Bounding Volume Hierarchy Magnus Andersson, PhD student (magnusa@cs.lth.se) This seminar We want to go from hundreds of triangles to thousands (or
Computer Graphics (CS 543) Lecture 13b Ray Tracing (Part 1) Prof Emmanuel Agu. Computer Science Dept. Worcester Polytechnic Institute (WPI)
Computer Graphics (CS 543) Lecture 13b Ray Tracing (Part 1) Prof Emmanuel Agu Computer Science Dept. Worcester Polytechnic Institute (WPI) Raytracing Global illumination-based rendering method Simulates
Scene Management. Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development
Video Game Technologies 11498: MSc in Computer Science and Engineering 11156: MSc in Game Design and Development Chap. 5 Scene Management Overview Scene Management vs Rendering This chapter is about rendering
Computer Graphics. Bing-Yu Chen National Taiwan University
Computer Graphics Bing-Yu Chen National Taiwan University Visible-Surface Determination Back-Face Culling The Depth-Sort Algorithm Binary Space-Partitioning Trees The z-buffer Algorithm Scan-Line Algorithm
CS580: Ray Tracing. Sung-Eui Yoon ( 윤성의 ) Course URL:
CS580: Ray Tracing Sung-Eui Yoon ( 윤성의 ) Course URL: http://sglab.kaist.ac.kr/~sungeui/gcg/ Recursive Ray Casting Gained popularity in when Turner Whitted (1980) recognized that recursive ray casting could
Ray Tracing Performance
Ray Tracing Performance Zero to Millions in 45 Minutes Gordon Stoll, Intel Ray Tracing Performance Zero to Millions in 45 Minutes?! Gordon Stoll, Intel Goals for this talk Goals point you toward the current
Specialized Acceleration Structures for Ray-Tracing. Warren Hunt
Specialized Acceleration Structures for Ray-Tracing Warren Hunt Bill Mark Forward: Flavor of Research Build is cheap (especially with scan, lazy and build from hierarchy) Grid build and BVH refit are really
Soft Shadow Volumes for Ray Tracing with Frustum Shooting
Soft Shadow Volumes for Ray Tracing with Frustum Shooting Thorsten Harter Markus Osswald Chalmers University of Technology Chalmers University of Technology University Karlsruhe University Karlsruhe Ulf
INFOMAGR Advanced Graphics. Jacco Bikker - February April Welcome!
INFOMAGR Advanced Graphics Jacco Bikker - February April 2016 Welcome! I x, x = g(x, x ) ε x, x + S ρ x, x, x I x, x dx Today s Agenda: Introduction Ray Distributions The Top-level BVH Real-time Ray Tracing
B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes
B-KD rees for Hardware Accelerated Ray racing of Dynamic Scenes Sven Woop Gerd Marmitt Philipp Slusallek Saarland University, Germany Outline Previous Work B-KD ree as new Spatial Index Structure DynR
Lecture 4 - Real-time Ray Tracing
INFOMAGR Advanced Graphics Jacco Bikker - November 2017 - February 2018 Lecture 4 - Real-time Ray Tracing Welcome! I x, x = g(x, x ) ε x, x + න S ρ x, x, x I x, x dx Today s Agenda: Introduction Ray Distributions
Computer Graphics. - Ray-Tracing II - Hendrik Lensch. Computer Graphics WS07/08 Ray Tracing II
Computer Graphics - Ray-Tracing II - Hendrik Lensch Overview Last lecture Ray tracing I Basic ray tracing What is possible? Recursive ray tracing algorithm Intersection computations Today Advanced acceleration
Universiteit Leiden Computer Science
Universiteit Leiden Computer Science Optimizing octree updates for visibility determination on dynamic scenes Name: Hans Wortel Student-no: 0607940 Date: 28/07/2011 1st supervisor: Dr. Michael Lew 2nd
Occluder Simplification using Planar Sections
Occluder Simplification using Planar Sections Ari Silvennoinen Hannu Saransaari Samuli Laine Jaakko Lehtinen Remedy Entertainment Aalto University Umbra Software NVIDIA NVIDIA Aalto University Coping with
CS535 Fall Department of Computer Science Purdue University
Spatial Data Structures and Hierarchies CS535 Fall 2010 Daniel G Aliaga Daniel G. Aliaga Department of Computer Science Purdue University Spatial Data Structures Store geometric information Organize geometric
Kinetic BV Hierarchies and Collision Detection
Kinetic BV Hierarchies and Collision Detection Gabriel Zachmann Clausthal University, Germany zach@tu-clausthal.de Bonn, 25. January 2008 Bounding Volume Hierarchies BVHs are standard DS for collision
Spatial Data Structures and Speed-Up Techniques. Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology
Spatial Data Structures and Speed-Up Techniques Tomas Akenine-Möller Department of Computer Engineering Chalmers University of Technology Spatial data structures What is it? Data structure that organizes
Bounding Volume Hierarchies
Tutorial: Real-Time Collision Detection for Dynamic Virtual Environments Bounding Volume Hierarchies Stefan Kimmerle WSI/GRIS University of Tübingen Outline Introduction Bounding Volume Types Hierarchy
Comparison of hierarchies for occlusion culling based on occlusion queries
Comparison of hierarchies for occlusion culling based on occlusion queries V.I. Gonakhchyan pusheax@ispras.ru Ivannikov Institute for System Programming of the RAS, Moscow, Russia Efficient interactive
Ray Tracing: Intersection
Computer Graphics as Virtual Photography Ray Tracing: Intersection Photography: real scene camera (captures light) photo processing Photographic print processing Computer Graphics: 3D models camera tone
Direct Rendering of Trimmed NURBS Surfaces
Direct Rendering of Trimmed NURBS Surfaces Hardware Graphics Pipeline 2/ 81 Hardware Graphics Pipeline GPU Video Memory CPU Vertex Processor Raster Unit Fragment Processor Render Target Screen Extended
On Fast Construction of Spatial Hierarchies for Ray Tracing. Vlastimil Havran Robert Herzog Hans-Peter Seidel
On Fast Construction of Spatial Hierarchies for Ray Tracing Vlastimil Havran Robert Herzog Hans-Peter Seidel MPI I 2006 4 004 June 2006 Author s Address Vlastimil Havran Robert Herzog Hans-Peter Seidel
Bounding Volume Hierarchies. CS 6965 Fall 2011
Bounding Volume Hierarchies 2 Heightfield 3 C++ Operator? #include int main() { int x = 10; while( x --> 0 ) // x goes to 0 { printf("%d ", x); } } stackoverflow.com/questions/1642028/what-is-the-name-of-this-operator
Acceleration Data Structures. Michael Doggett Department of Computer Science Lund university
Acceleration Data Structures Michael Doggett Department of Computer Science Lund university Ray tracing So far ray tracing sampling object intersections Today How do we make it faster? Performance = rays
Last Time: Acceleration Data Structures for Ray Tracing. Schedule. Today. Shadows & Light Sources. Shadows
Last Time: Acceleration Data Structures for Ray Tracing Modeling Transformations Illumination (Shading) Viewing Transformation (Perspective / Orthographic) Clipping Projection (to Screen Space) Scan Conversion
Spatial Data Structures
Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) [Angel 9.10] Outline Ray tracing review what rays matter? Ray tracing speedup faster
Parallel Physically Based Path-tracing and Shading Part 3 of 2. CIS565 Fall 2012 University of Pennsylvania by Yining Karl Li
Parallel Physically Based Path-tracing and Shading Part 3 of 2 CIS565 Fall 202 University of Pennsylvania by Yining Karl Li Jim Scott 2009 Spatial cceleration Structures: KD-Trees *Some portions of these
Acceleration Structure for Animated Scenes. Copyright 2010 by Yong Cao
t min X X Y 1 B C Y 1 Y 2 A Y 2 D A B C D t max t min X X Y 1 B C Y 2 Y 1 Y 2 A Y 2 D A B C D t max t min X X Y 1 B C Y 1 Y 2 A Y 2 D A B C D t max t min A large tree structure change. A totally new tree!
Using Bounding Volume Hierarchies Efficient Collision Detection for Several Hundreds of Objects
Part 7: Collision Detection Virtuelle Realität Wintersemester 2007/08 Prof. Bernhard Jung Overview Bounding Volumes Separating Axis Theorem Using Bounding Volume Hierarchies Efficient Collision Detection
Ray Intersection Acceleration
Ray Intersection Acceleration CMPT 461/761 Image Synthesis Torsten Möller Reading Chapter 2, 3, 4 of Physically Based Rendering by Pharr&Humphreys An Introduction to Ray tracing by Glassner Topics today
Lecture 25 of 41. Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees
Spatial Sorting: Binary Space Partitioning Quadtrees & Octrees William H. Hsu Department of Computing and Information Sciences, KSU KSOL course pages: http://bit.ly/hgvxlh / http://bit.ly/evizre Public
Grid-based SAH BVH construction on a GPU
Vis Comput DOI 10.1007/s00371-011-0593-8 ORIGINAL ARTICLE Grid-based SAH BVH construction on a GPU Kirill Garanzha Simon Premože Alexander Bely Vladimir Galaktionov Springer-Verlag 2011 Abstract We present
GPU-BASED RAY TRACING ALGORITHM USING UNIFORM GRID STRUCTURE
GPU-BASED RAY TRACING ALGORITHM USING UNIFORM GRID STRUCTURE Reza Fuad R 1) Mochamad Hariadi 2) Telematics Laboratory, Dept. Electrical Eng., Faculty of Industrial Technology Institut Teknologi Sepuluh
Johannes Hanika September 11, Fixed Point Hardware Ray Tracing
Johannes Hanika September 11, 2007 Fixed Point Hardware Ray Tracing Page 2 Fixed Point Hardware Ray Tracing Fixed Point Hardware Ray Tracing September 11, 2007 Fixed Point Hardware Ray Tracing Motivation
Spatial Data Structures
15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) April 1, 2003 [Angel 9.10] Frank Pfenning Carnegie
Half-precision Floating-point Ray Traversal
Half-precision Floating-point Ray Traversal Matias Koskela, Timo Viitanen, Pekka Jääskeläinen and Jarmo Takala Department of Pervasive Computing, Tampere University of Technology, Korkeakoulunkatu 1, 33720,
CS 465 Program 5: Ray II
CS 465 Program 5: Ray II out: Friday 2 November 2007 due: Saturday 1 December 2007 Sunday 2 December 2007 midnight 1 Introduction In the first ray tracing assignment you built a simple ray tracer that
Ray Casting of Trimmed NURBS Surfaces on the GPU
Ray Casting of Trimmed NURBS Surfaces on the GPU Hans-Friedrich Pabst Jan P. Springer André Schollmeyer Robert Lenhardt Christian Lessig Bernd Fröhlich Bauhaus University Weimar Faculty of Media Virtual
Two Optimization Methods for Raytracing. W. Sturzlinger and R. F. Tobler
Two Optimization Methods for Raytracing by W. Sturzlinger and R. F. Tobler Johannes Kepler University of Linz Institute for Computer Science Department for graphical and parallel Processing Altenbergerstrae
Acceleration of Ray-Casting for CSG scenes
Charles University in Prague Faculty of Mathematics and Physics MASTER THESIS Petr Zajíček Acceleration of Ray-Casting for CSG scenes Department of Software and Computer Science Education Supervisor of
Fast kd-tree Construction for 3D-Rendering Algorithms Like Ray Tracing
Fast kd-tree Construction for 3D-Rendering Algorithms Like Ray Tracing Sajid Hussain and Håkan Grahn Blekinge Institute of Technology SE-371 79 Karlskrona, Sweden {sajid.hussain,hakan.grahn}@bth.se http://www.bth.se/tek/paarts
Spatial Data Structures
15-462 Computer Graphics I Lecture 17 Spatial Data Structures Hierarchical Bounding Volumes Regular Grids Octrees BSP Trees Constructive Solid Geometry (CSG) March 28, 2002 [Angel 8.9] Frank Pfenning Carnegie
Lecture 11: Ray tracing (cont.)
Interactive Computer Graphics Ray tracing - Summary Lecture 11: Ray tracing (cont.) Graphics Lecture 10: Slide 1 Some slides adopted from H. Pfister, Harvard Graphics Lecture 10: Slide 2 Ray tracing -
MSBVH: An Efficient Acceleration Data Structure for Ray Traced Motion Blur
: An Efficient Acceleration Data Structure for Ray Traced Motion Blur Leonhard Gru nschloß NVIDIA / Weta Digital (a) Hairball rendered with motion blur. Martin Stich NVIDIA Sehera Nawaz NVIDIA / Weta Digital
Accelerating Shadow Rays Using Volumetric Occluders and Modified kd-tree Traversal
Accelerating Shadow Rays Using Volumetric Occluders and Modified kd-tree Traversal Peter Djeu*, Sean Keely*, and Warren Hunt * University of Texas at Austin Intel Labs Shadow Rays Shadow rays are often
Spatial Data Structures and Acceleration Algorithms
Spatial Data Structures and Acceleration Algorithms Real-time Renderg Performance Goals Spatial Structures Boundg Volume Hierarchies (BVH) Bary Space Partiong(BSP) Trees, Octrees Scene Graphs Cullg Techniques
CS 563 Advanced Topics in Computer Graphics Culling and Acceleration Techniques Part 1 by Mark Vessella
CS 563 Advanced Topics in Computer Graphics Culling and Acceleration Techniques Part 1 by Mark Vessella Introduction Acceleration Techniques Spatial Data Structures Culling Outline for the Night Bounding
Logistics. CS 586/480 Computer Graphics II. Questions from Last Week? Slide Credits
CS 586/480 Computer Graphics II Dr. David Breen Matheson 408 Thursday 6PM Æ 8:50PM Presentation 4 10/28/04 Logistics Read research paper and prepare summary and question P. Hanrahan, "Ray Tracing Algebraic
Dynamic Acceleration Structures for Interactive Ray Tracing
Dynamic Acceleration Structures for Interactive Ray Tracing Erik Reinhard, Brian Smits and Charles Hansen University of Utah reinhard bes hansen@cs.utah.edu Abstract. Acceleration structures used for ray
Accelerating Ray Tracing
Accelerating Ray Tracing Ray Tracing Acceleration Techniques Faster Intersections Fewer Rays Generalized Rays Faster Ray-Object Intersections Object bounding volumes Efficient intersection routines Fewer
Questions from Last Week? Extra rays needed for these effects. Shadows Motivation
CS 431/636 Advanced Rendering Techniques Dr. David Breen University Crossings 149 Tuesday 6PM 8:50PM Presentation 4 4/22/08 Questions from Last Week? Color models Light models Phong shading model Assignment
CS 431/636 Advanced Rendering Techniques
CS 431/636 Advanced Rendering Techniques Dr. David Breen University Crossings 149 Tuesday 6PM 8:50PM Presentation 4 4/22/08 Questions from Last Week? Color models Light models Phong shading model Assignment
Recall: Inside Triangle Test
1/45 Recall: Inside Triangle Test 2D Bounding Boxes rasterize( vert v[3] ) { bbox b; bound3(v, b); line l0, l1, l2; makeline(v[0],v[1],l2); makeline(v[1],v[2],l0); makeline(v[2],v[0],l1); for( y=b.ymin;
CS 4620 Program 4: Ray II
CS 4620 Program 4: Ray II out: Tuesday 11 November 2008 due: Tuesday 25 November 2008 1 Introduction In the first ray tracing assignment you built a simple ray tracer that handled just the basics. In this