Cache-Efficient Layouts of BVHs and Meshes

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

The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Interactive Visualization and Collision Detection using Dynamic Simplification and Cache-Coherent Layouts.
Zhiguo Ge, Weng-Fai Wong, and Hock-Beng Lim Proceedings of the Design, Automation, and Test in Europe Conference, 2007 (DATE’07) April /4/17.
Introduction to Massive Model Visualization Patrick Cozzi Analytical Graphics, Inc.
Memory-Efficient Sliding Window Progressive Meshes Pavlo Turchyn University of Jyvaskyla.
LLNL-PRES This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under contract DE-AC52-07NA27344.
Mesh Layouts for Block-Based Caches Sung-Eui Yoon Peter Lindstrom Lawrence Livermore National Laboratory.
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.
ECE 562 Computer Architecture and Design Project: Improving Feature Extraction Using SIFT on GPU Rodrigo Savage, Wo-Tak Wu.
Haptic Rendering using Simplification Comp259 Sung-Eui Yoon.
Cody White Department of Computer Science and Engineering University of Nevada, Reno.
IE 590 J Cecil NMSU 1 IE 590 Integrated Manufacturing Systems Lecture 4 CAD & Geometric Modeling.
lecture 4 : Isosurface Extraction
GPU Proximity Queries with Swept Sphere Volumes COMP Robotics Project Proposal Qi Mo.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Cache-Oblivious Mesh Layouts Sung-Eui Yoon, Peter Lindstrom Valerio Pascucci, Dinesh Manocha 1: University.
Parallel Decomposition-based Contact Response Fehmi Cirak California Institute of Technology.
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.
Lossless Compression of Floating-Point Geometry Martin Isenburg UNC Chapel Hill Peter Lindstrom LLNL Livermore Jack Snoeyink UNC Chapel Hill.
Interactive Shadow Generation in Complex Environments Naga K. Govindaraju, Brandon Lloyd, Sung-Eui Yoon, Avneesh Sud, Dinesh Manocha Speaker: Alvin Date:
1 Aug 7, 2004 GPU Req GPU Requirements for Large Scale Scientific Applications “Begin with the end in mind…” Dr. Mark Seager Asst DH for Advanced Technology.
Geometric Sound Propagation Anish Chandak & Dinesh Manocha UNC Chapel Hill
The max-divergence of E’ is: Intuitively, p-divergence of d means that the probability of at least X E’,p edges occurring p-recently is 1/d A (maximal)
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,
UNC Chapel Hill M. C. Lin Overview of Last Lecture About Final Course Project –presentation, demo, write-up More geometric data structures –Binary Space.
R-LODs: Fast LOD-based Ray Tracing of Massive Models Sung-Eui Yoon Lawrence Livermore National Lab. Christian Lauterbach Dinesh Manocha Univ. of North.
The UNIVERSITY of NORTH CAROLINA at CHAPEL HILL Collision Detection for Deformable Objects Xin Huang 16/10/2007.
Jin Yao Lawrence Livermore National Laboratory *This work was performed under the auspices of the U.S. Department of Energy by the University of California,
1 A Novel Page-Based Data Structure for Interactive Walkthroughs Behzad Sajadi Yan Huang Pablo Diaz-Gutierrez Sung-Eui Yoon M. Gopi.
Data Management Techniques Sung-Eui Yoon KAIST URL:
Compressing Multiresolution Triangle Meshes Emanuele Danovaro, Leila De Floriani, Paola Magillo, Enrico Puppo Department of Computer and Information Sciences.
UNC Chapel Hill M. C. Lin Point Location Reading: Chapter 6 of the Textbook Driving Applications –Knowing Where You Are in GIS Related Applications –Triangulation.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,
So far we have covered … Basic visualization algorithms Parallel polygon rendering Occlusion culling They all indirectly or directly help understanding.
Bounds on the Geometric Mean of Arc Lengths for Bounded- Degree Planar Graphs M. K. Hasan Sung-eui Yoon Kyung-Yong Chwa KAIST, Republic of Korea.
Efficient Deployment Algorithms for Prolonging Network Lifetime and Ensuring Coverage in Wireless Sensor Networks Yong-hwan Kim Korea.
Triangular Mesh Decimation
RACBVHs: Random-Accessible Compressed Bounding Volume Hierarchies Tae-Joon Kim Bochang Moon Duksu Kim Sung-Eui Yoon KAIST (Korea Advanced Institute of.
Martin Schulz Center for Applied Scientific Computing Lawrence Livermore National Laboratory Lawrence Livermore National Laboratory, P. O. Box 808, Livermore,
How does laser cost scaling affect the power plant optimization? HAPL Program Meeting PPPL Dec 12-13, 2006 Wayne Meier LLNL Work performed under the auspices.
Supercomputing ‘99 Parallelization of a Dynamic Unstructured Application using Three Leading Paradigms Leonid Oliker NERSC Lawrence Berkeley National Laboratory.
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)
Vertices, Edges and Faces By Jordan Diamond. Vertices In geometry, a vertices is a special kind of point which describes the corners or intersections.
PMR: Point to Mesh Rendering, A Feature-Based Approach Tamal K. Dey and James Hudson
BOĞAZİÇİ UNIVERSITY – COMPUTER ENGINEERING Mehmet Balman Computer Engineering, Boğaziçi University Parallel Tetrahedral Mesh Refinement.
GA 1 CASC Discovery of Access Patterns to Scientific Simulation Data Ghaleb Abdulla LLNL Center for Applied Scientific Computing.
David Stotts Computer Science Department UNC Chapel Hill.
Interactive Continuous Collision Detection for Polygon Soups Xin Huang 11/20/2007.
Path/Ray Tracing Examples. Path/Ray Tracing Rendering algorithms that trace photon rays Trace from eye – Where does this photon come from? Trace from.
LLNL-PRES This work was performed under the auspices of the U.S. Department of Energy by Lawrence Livermore National Laboratory under Contract DE-AC52-07NA27344.
Fast Collision Detection for Deformable Models using Representative-Triangles Presented by Marcus Parker By Sean Curtis, Rasmus Tamstorf and Dinesh Manocha.
Ana Gainaru Aparna Sasidharan Babak Behzad Jon Calhoun
Optimized Continuous Collision Detection for Deformable Triangle Meshes Marco Hutter and Arnulph Fuhrmann WCSG’2007 – 30 January, 2007 – Plzen,
Real-Time Ray Tracing Stefan Popov.
Hybrid Ray Tracing of Massive Models
Parts of these slides are based on
Arthur D Gregory, Andrei State, Ming C Lin,
Predictive Performance
Heat Simulations with COMSOL
Parallel Applications And Tools For Cloud Computing Environments
ATO Project: Year 3 Main Tasks
Chap 10. Geometric Level of Detail
Interactive Massive Model Rendering
Motivation Contemporary big data tools such as MapReduce and graph processing tools have fixed data abstraction and support a limited set of communication.
Presentation transcript:

Cache-Efficient Layouts of BVHs and Meshes 2 Sung-Eui Yoon, Peter Lindstrom, Dinesh Manocha 1: Lawrence Livermore National Laboratory 2: University of North Carolina - Chapel Hill 1 1 http://gamma.cs.unc.edu/COL/OpenCCL/ Abstract: Current computer architectures employ various caches to improve the performance of a wide variety of applications. One of the main characteristics of such cache schemes is the use of block fetching whenever an uncached data element is accessed. To maximize its benefits, we present novel cache-efficient layouts of polygonal meshes and bounding volume hierarchies that improve the performance of interactive visualization and geometric processing algorithms. By using our cache-efficient layouts, we are able to improve the performance of various applications without any code modifications. Source codes of our work are available as the OpenCCL library. Our Goals: Theoretical Results: – Derive a metric measuring the expected number of cache misses of layouts given an I/O model – Measure the probability that a bounding volume node of BVHs will be accessed at runtime – Design efficient layout algorithms for meshes and hierarchies given metrics – Computing cache-aware layouts of graphs representing runtime access patterns is reduced to graph partitioning – Cache-oblivious metrics predicting the number of cache misses are either a linear or a log function of edge lengths in the layout depending on a block size assumption – New probabilistic model predicting runtime behavior on BVHs 105 Cache: Block: Memory: Two level I/O Model Optimized layouts with our metrics Results on Meshes: Results on BVHs: Below left, we test different layouts during iso-surface extraction from the Spx tetrahedral mesh (140K vertices). Below right, GPU vertex cache miss ratios are shown during view-dependent rendering of the power plant model (12M triangles) Power plant with Hugo robot model Collision detection time between the power plant and robot models Collision detection times Render time of ray tracing of Lucy model Comparison with other layouts in Iso-Surface Extraction GPU vertex cache miss ratio of different layouts This work was performed under the auspices of the U.S. Department of Energy by University of California Lawrence Livermore National Laboratory under contract No. W-7405-Eng-48. UCRL-POST-221342