Corrections to the Surface Area Metric with Respect to Mail-Boxing Warren Hunt.

Slides:



Advertisements
Similar presentations
R&D Portfolio Optimization One Stage R&D Portfolio Optimization with an Application to Solid Oxide Fuel Cells Lauren Hannah 1, Warren Powell 1, Jeffrey.
Advertisements

1 CREATING AN ADMINISTRATIVE DRAW REQUEST (HBA) Complete a Checklist for Administrative Draw Requests (Form 16.08). Draw Requests amount must agree with.
1 CREATING AN ADMINISTRATIVE DRAW REQUEST (OCC) Complete a Checklist for Administrative Draw Requests (Form 16.08). Draw Requests amount must agree with.
GR2 Advanced Computer Graphics AGR
GR2 Advanced Computer Graphics AGR
The 5S numbers game..
1 Competitive Privacy: Secure Analysis on Integrated Sequence Data Raymond Chi-Wing Wong 1, Eric Lo 2 The Hong Kong University of Science and Technology.
Lectures 6&7: Variance Reduction Techniques
Hierarchical Cellular Tree: An Efficient Indexing Scheme for Content-Based Retrieval on Multimedia Databases Serkan Kiranyaz and Moncef Gabbouj.
On Comparing Classifiers : Pitfalls to Avoid and Recommended Approach
Business and Economics 6th Edition
The Modular Structure of Complex Systems Team 3 Nupur Choudhary Aparna Nanjappa Mark Zeits.
0 Solving Problems in Groups ©2008, University of Vermont and PACER Center Solving Problems in Groups PCL Module 9.
1 Department of Computer Science, University of Sheffield eXtreme Programming - Practices Dr. Marian Gheorghe.
1.3 Segments, Rays, Lines and Planes
An Optimized Soft Shadow Volume Algorithm with Real-Time Performance Ulf Assarsson 1, Michael Dougherty 2, Michael Mounier 2, and Tomas Akenine-Möller.
Paper 1 Source Questions What is the message. What is the purpose
Mani Srivastava UCLA - EE Department Room: 6731-H Boelter Hall Tel: WWW: Copyright 2003.
Application to find Eukaryotic Open reading frames. Lab.
Sven Woop Computer Graphics Lab Saarland University
The Wealth of Nations Jamie Brabston Matt Caulfield Mark Testa.
 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --
Christian Lauterbach COMP 770, 2/16/2009. Overview  Acceleration structures  Spatial hierarchies  Object hierarchies  Interactive Ray Tracing techniques.
1 Spatial Join. 2 Papers to Present “Efficient Processing of Spatial Joins using R-trees”, T. Brinkhoff, H-P Kriegel and B. Seeger, Proc. SIGMOD, 1993.
Restart Trail for Stackless BVH Traversal Samuli Laine NVIDIA Research.
Ray Tracing Ray Tracing 1 Basic algorithm Overview of pbrt Ray-surface intersection (triangles, …) Ray Tracing 2 Brute force: Acceleration data structures.
Overview Fundamentals
Coupling-Aware Length-Ratio- Matching Routing for Capacitor Arrays in Analog Integrated Circuits Kuan-Hsien Ho, Hung-Chih Ou, Yao-Wen Chang and Hui-Fang.
Ray Tracing & Radiosity Dr. Amy H. Zhang. Outline  Ray tracing  Radiosity.
Korea Univ. Graphics Lab. 3D Game Engine Design Chapter 12. Spatial Sorting Chung Ji Hye
Collision Detection CSE 191A: Seminar on Video Game Programming Lecture 3: Collision Detection UCSD, Spring, 2003 Instructor: Steve Rotenberg.
Ray Tracing Acceleration Structures Solomon Boulos 4/16/2004.
Specialized Acceleration Structures for Ray-Tracing Warren Hunt Bill Mark.
A lion in the desert How do you find a lion in the desert? How about when you have a predicate that tells you if the lion is in front or behind a separating.
Specialized Acceleration Structures for Ray-Tracing Warren Hunt Bill Mark.
Ray Tracing Dynamic Scenes using Selective Restructuring Sung-eui Yoon Sean Curtis Dinesh Manocha Univ. of North Carolina at Chapel Hill Lawrence Livermore.
OBBTree: A Hierarchical Structure for Rapid Interference Detection Gottschalk, M. C. Lin and D. ManochaM. C. LinD. Manocha Department of Computer Science,
Point Location Computational Geometry, WS 2007/08 Lecture 5 Prof. Dr. Thomas Ottmann Algorithmen & Datenstrukturen, Institut für Informatik Fakultät für.
Optimized Subdivisions for Preprocessed Visibility Oliver Mattausch, Jiří Bittner, Peter Wonka, Michael Wimmer Institute of Computer Graphics and Algorithms.
A lion in the desert How do you find a lion in the desert? How about when you have a predicate that tells you if the lion is in front or behind a separating.
Bounding Volume Hierarchies and Spatial Partitioning Kenneth E. Hoff III COMP-236 lecture Spring 2000.
Introduction to 3D Graphics John E. Laird. Basic Issues u Given a internal model of a 3D world, with textures and light sources how do you project it.
Computer Graphics 2 Lecture x: Acceleration Techniques for Ray-Tracing Benjamin Mora 1 University of Wales Swansea Dr. Benjamin Mora.
New Protocols for Remote File Synchronization Based on Erasure Codes Utku Irmak Svilen Mihaylov Torsten Suel Polytechnic University.
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
LIGHT AND ITS USES. LIGHT RAY STRAIGHT LINE PATH OF LIGHT.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
1 Speeding Up Ray Tracing Images from Virtual Light Field Project ©Slides Anthony Steed 1999 & Mel Slater 2004.
The Demand Side: Consumption & Saving. Created By: Reem M. Al-Hajji.
Nonoverlap of the Star Unfolding Boris Aronov and Joseph O’Rourke, 1991 A Summary by Brendan Lucier, 2004.
Saarland University, Germany B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes Sven Woop Gerd Marmitt Philipp Slusallek.
CIS 350 – I Game Programming Instructor: Rolf Lakaemper.
Stefan Popov Space Subdivision for BVHs Stefan Popov, Iliyan Georgiev, Rossen Dimov, and Philipp Slusallek Object Partitioning Considered Harmful: Space.
Ray Tracing Fall, Introduction Simple idea  Forward Mapping  Natural phenomenon infinite number of rays from light source to object to viewer.
Presented by Paul Phipps
Where We Stand At this point we know how to: –Convert points from local to window coordinates –Clip polygons and lines to the view volume –Determine which.
Computer Graphics I, Fall 2010 Implementation II.
Warm Up2/4/13 Solve each equation 1) 5x + 6 – x – 8 = 422) 2(x + 5) = 14 3)
Analysis of the increase and Decrease Algorithms for Congestion in Computer Networks Portions of the slide/figures were adapted from :
Ray Tracing Acceleration (3)
Bounding Volume Hierarchies and Spatial Partitioning
Science Scavenger Hunt: The Search for Inclined Planes and Pulleys
Optimized Continuous Collision Detection for Deformable Triangle Meshes Marco Hutter and Arnulph Fuhrmann WCSG’2007 – 30 January, 2007 – Plzen,
STBVH: A Spatial-Temporal BVH for Efficient Multi-Segment Motion Blur
Bounding Volume Hierarchies and Spatial Partitioning
Real-Time Ray Tracing Stefan Popov.
Some hints about writing a scientific paper San Francisco Edit www
ENTERPRISE RESOURCE PLANNING- ERP UNIT-1 INTRODUCTION Overview of Enterprise System Evolution Risks and Benefits Fundamental Technology Issues to be consider.
Efficient Distance Computation between Non-Convex Objects
CSCE 441: Computer Graphics Ray Tracing
Presentation transcript:

Corrections to the Surface Area Metric with Respect to Mail-Boxing Warren Hunt

Introduction The Surface Area Metric is the most common cost metric for acceleration structures The metric doesn’t account for the effects of mail-boxing (when present)

What is Mail-boxing? Optimization for partitioning based acceleration structures Attempts to avoid multiple intersection tests between the same ray/object pair

Contribution Overview Present a correction to the surface area metric for mail-boxing – Extremely simple to implement – Significant reduction in intersection tests – Modest improvement in performance – Improves the effectiveness of mail-boxing

The Surface Area Metric Cost(s) = P(s left )Cost(s left ) + P(s right )Cost(s right ) P is the probability function (based on surface area) During build, cost is estimated by the number of objects overlapping each side – Mail-boxing changes this cost!

Corrected Surface Area Metric Cost(s) = P(s left )*Cost(s left ) + P(s right )*Cost(s right ) - P(s right^left )*Cost(s right^left ) P(s left^right ) is the probability that a ray strikes both sides of the split – Partition is convex, use ratio of surface areas Cost(s left^right ) is the number of objects that occur on both sides of the split

Effects of the Modification Fundamentally changes the effectiveness of kd-trees when using mail-boxing – Allows splits that the SAH wouldn’t previously allow – Allows mail-boxing to fully address the integral duplication problem in kd-trees (explained shortly!)

Example: Abutted Cells KD-Tree Split Plane Left BVRight BV

Example: Overlapping Cells Left BVRight BV 1 1-Δ2Δ KD-Tree Split Planes – Original SAM wouldn’t allow either of these splits! – Detailed explanation in the paper KD-Tree Split Plane

Results ~30% reduction in intersection tests when compared to the uncorrected SAM ~5% reduction in overall render-time ~5% increase in traversal steps Results are fairly consistent between off-line and real-time ray-tracers

Specific Results Teaser Using an interactive ray-tracer FForest020IntersectionsTimeSteps Original M3.359 s96.10 M Modified M3.006 s99.54 M Difference -27%-10.2%+3.58%

Conclusions Presented a correction to the surface area metric for mail-boxing – Extremely simple to implement – Significant reduction in intersection tests – Modest improvement in performance – Improves the effectiveness of mail-boxing

Questions?

Advertisement! I’m graduating this fall and looking for a job! – Formally as of now – Willing to relocate etc.

Perspective Questions?