Interactive Volume Visualization of General Polyhedral Grids Philipp Muigg 1,3, Markus Hadwiger 2, Helmut Doleisch 3, M. Eduard Gröller 1 1, Vienna University.

Slides:

Advertisements

Similar presentations

Sven Woop Computer Graphics Lab Saarland University

Advertisements

VIS Group, University of Stuttgart Tutorial T4: Programmable Graphics Hardware for Interactive Visualization Pre-Integrated Splatting (Stefan Roettger)

Direct Volume Rendering. What is volume rendering? Accumulate information along 1 dimension line through volume.

A Coherent Grid Traversal Algorithm for Volume Rendering Ioannis Makris Supervisors: Philipp Slusallek*, Céline Loscos *Computer Graphics Lab, Universität.

GI 2006, Québec, June 9th 2006 Implementing the Render Cache and the Edge-and-Point Image on Graphics Hardware Edgar Velázquez-Armendáriz Eugene Lee Bruce.

A Hardware-Assisted Hybrid Rendering Technique for Interactive Volume Visualization Brett Wilson Kwan-Liu Ma University of California, Davis Patrick S.

Two-Level Grids for Ray Tracing on GPUs

WSCG 2007 Memory Efficient and Robust Software Implementation of the Raycast Algorithm Aline Pina COPPE/UFRJ Rio de Janeiro - Brazil

University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.

Acceleration of the Smith– Waterman algorithm using single and multiple graphics processors Author : Ali Khajeh-Saeed, Stephen Poole, J. Blair Perot. Publisher:

Rasterization and Ray Tracing in Real-Time Applications (Games) Andrew Graff.

HCI 530 : Seminar (HCI) Damian Schofield.

Control Flow Virtualization for General-Purpose Computation on Graphics Hardware Ghulam Lashari Ondrej Lhotak University of Waterloo.

Introduction to Volume Rendering Presented by Zvi Devir.

Adapted from: CULLIDE: Interactive Collision Detection Between Complex Models in Large Environments using Graphics Hardware Naga K. Govindaraju, Stephane.

GPU-Based Frequency Domain Volume Rendering Ivan Viola, Armin Kanitsar, and Meister Eduard Gröller Institute of Computer Graphics and Algorithms Vienna.

Parallelizing Raytracing Gillian Smith CMPE 220 February 19 th, 2008.

Memory Efficient Acceleration Structures and Techniques for CPU-based Volume Raycasting of Large Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller.

E. WES BETHEL (LBNL), CHRIS JOHNSON (UTAH), KEN JOY (UC DAVIS), SEAN AHERN (ORNL), VALERIO PASCUCCI (LLNL), JONATHAN COHEN (LLNL), MARK DUCHAINEAU.

Hardware-Based Nonlinear Filtering and Segmentation using High-Level Shading Languages I. Viola, A. Kanitsar, M. E. Gröller Institute of Computer Graphics.

Accelerating Marching Cubes with Graphics Hardware Gunnar Johansson, Linköping University Hamish Carr, University College Dublin.

Hardware-Assisted Visibility Sorting for Tetrahedral Volume Rendering Steven Callahan Milan Ikits João Comba Cláudio Silva Steven Callahan Milan Ikits.

VOTS VOlume doTS as Point-based Representation of Volumetric Data S. Grimm, S. Bruckner, A. Kanitsar and E. Gröller Institute of Computer Graphics and.

Scientific Visualization Data and Geometry Processing for Scientific Visualization CS 5630 / 6630 August 28, 2007.

The edge buffer : A data structure for easy silhouette rendering by John W. Buchanan and Mario C. Sousa.

University of Michigan Electrical Engineering and Computer Science Amir Hormati, Mehrzad Samadi, Mark Woh, Trevor Mudge, and Scott Mahlke Sponge: Portable.

Interactive Volume Visualization of General Polyhedral Grids Philipp Muigg 1,3, Markus Hadwiger 2, Helmut Doleisch 3, M. Eduard Gröller 1 1, Vienna University.

GPU Graphics Processing Unit. Graphics Pipeline Scene Transformations Lighting & Shading ViewingTransformations Rasterization GPUs evolved as hardware.

Zoltan Szego †*, Yoshihiro Kanamori ‡, Tomoyuki Nishita † † The University of Tokyo, *Google Japan Inc., ‡ University of Tsukuba.

Interactive Visualization of Volumetric Data on Consumer PC Hardware: Introduction Daniel Weiskopf Graphics Hardware Trends Faster development than Moore’s.

Mapping Computational Concepts to GPUs Mark Harris NVIDIA Developer Technology.

REAL-TIME VOLUME GRAPHICS Markus Hadwiger VRVis Research Center, Vienna Eurographics 2006 Real-Time Volume Graphics [04] GPU-Based Ray-Casting.

Lecture 3 : Direct Volume Rendering Bong-Soo Sohn School of Computer Science and Engineering Chung-Ang University Acknowledgement : Han-Wei Shen Lecture.

Adaptive Real-Time Rendering of Planetary Terrains WSCG 2010 Raphaël Lerbour Jean-Eudes Marvie Pascal Gautron THOMSON R&D, Rennes, France.

Geometry Textures Rodrigo de Toledo, ( PhD candidate at LORIA-INRIA) (Researcher at Tecgraf, PUC-Rio) Bin Wang and Bruno Levy.

Cg Programming Mapping Computational Concepts to GPUs.

Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,

£899 – Ultimatum Computers indiegogo.com/ultimatumcomputers The Ultimatum.

Porting Irregular Reductions on Heterogeneous CPU-GPU Configurations Xin Huo, Vignesh T. Ravi, Gagan Agrawal Department of Computer Science and Engineering.

A Fast Shadow Algorithm for Area Light Sources Using Backprojection George Drettakis Eugene Fiume Department of Computer Science University of Toronto,

Tracking with CACTuS on Jetson Running a Bayesian multi object tracker on a low power, embedded system School of Information Technology & Mathematical.

Tracking with CACTuS on Jetson Running a Bayesian multi object tracker on an embedded system School of Information Technology & Mathematical Sciences September.

Interactive Visualization of Exceptionally Complex Industrial CAD Datasets Andreas Dietrich Ingo Wald Philipp Slusallek Computer Graphics Group Saarland.

Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.

1 Real-time visualization of large detailed volumes on GPU Cyril Crassin, Fabrice Neyret, Sylvain Lefebvre INRIA Rhône-Alpes / Grenoble Universities Interactive.

Saarland University, Germany B-KD Trees for Hardware Accelerated Ray Tracing of Dynamic Scenes Sven Woop Gerd Marmitt Philipp Slusallek.

Representation of Objects with Sharp Details in Truncated Distance Fields Pavol Novotný Comenius University, Bratislava, Slovakia Miloš Šrámek Austrian.

Real-time Rendering of Heterogeneous Translucent Objects with Arbitrary Shapes Stefan Kinauer KAIST (Korea Advanced Institute of Science and Technology)

Evaluation of a Bricked Volume Layout for a Medical Workstation based on Java Peter Kohlmann, Stefan Bruckner, Armin Kanitsar, M. Eduard Gröller Institute.

Exploded Views for Volume Data Stefan Bruckner and M. Eduard Gröller IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, VOL. 12, NO. 5, 2006.

Computer Graphics II University of Illinois at Chicago Volume Rendering Presentation for Computer Graphics II Prof. Andy Johnson By Raj Vikram Singh.

Efficient Streaming of 3D Scenes with Complex Geometry and Complex Lighting Romain Pacanowski and M. Raynaud X. Granier P. Reuter C. Schlick P. Poulin.

Design and Implementation of Geometric and Texture-Based Flow Visualization Techniques Robert S. Laramee Markus Hadwiger Helwig Hauser.

Motivation Properties of real data sets Surface like structures

Graphics Interface 2009 The-Kiet Lu Kok-Lim Low Jianmin Zheng 1.

Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.

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

David Angulo Rubio FAMU CIS GradStudent. Introduction  GPU(Graphics Processing Unit) on video cards has evolved during the last years. They have become.

Mapping Computational Concepts to GPUs Mark Harris NVIDIA.

Unstructured Volume Rendering. Grid Types uniformrectilinearregularcurvilinear Structured Grids: regularirregularhybridcurved Unstructured Grids:

Interactive Terascale Particle Visualization Ellsworth, Green, Moran (NASA Ames Research Center)

Wei Hong, Feng Qiu, Arie Kaufman Center for Visual Computing and Department of Computer Science, Stony Brook University

Contextual Snapshots: Enriched Visualization with Interactive Spatial Annotations Peter Mindek 1, Stefan Bruckner 2,1 and M. Eduard Gröller 1 1 Institute.

A novel approach to visualizing dark matter simulations

Tamas Szalay, Volker Springel, Gerard Lemson

Image Space Based Visualization of Unsteady Flow on Surfaces

Boolean Operations for Free-form Models Represented in Geometry Images

An Analysis of Region Clustered BVH Volume Rendering on GPU

Time-varying volume visualization and compression

Presentation transcript:

Interactive Volume Visualization of General Polyhedral Grids Philipp Muigg 1,3, Markus Hadwiger 2, Helmut Doleisch 3, M. Eduard Gröller 1 1, Vienna University of Technology, Austria 2, King Abdullah University of Science and Technology, Saudi Arabia 3, SimVis GmbH, Vienna, Austria

Motivation Computational Fluid Dynamics (CFD) simulations Increase in size Meshes become more complex

Motivation Many unstructured grid volume visualization techniques limited to tetrahedral grids Tetrahedralization required 1.4M poly cells (~89M tets)82K poly cells (~4M tets)

Motivation Direct volume rendering for grids composed of general polyhedral cells Data structure to represent polyhedral grids Low memory footprint Support traversal operations required by ray casting

Data Structure Requirements for ray casting Query all faces of a cell Query neighouring cell across a face Query vertices of a face

Data Structure 2D illustration 3D Faces  2D Edges 3D Cells  2D Faces Example contains 6 „faces“ 3 „cells“

Common grid representations cell centered Data Structure 6 links

Data Structure Common grid representations cell centered Cell to cell traversal for ray casting requires (redundant) face connectivity

Data Structure Redundancy Cell to face data derivable from face to cell data Face to cell data derivable from cell to face data 21 links

Data Structure: TSFL Two sided face lists (TSFL) Face based (comparable to winged/half edge) Cells represented via linked lists Two links per face (front and back link)

Data Structure: TSFL Additional bit flag per link (front and back flag) Blue  facing towards cell Green  facing away from cell

Data Structure: TSFL Visit all faces of a cell via links Select link at face based on previous flag Step from one cell to neighbour by selecting other link 12 links

Data Structure: TSFSL Two sided face sequence lists (TSFSL) Group faces facing towards same cell Discard front links (retain last in sequence)

Data Structure: TSFSL Two sided face sequence lists (TSFSL) Group faces facing towards same cell Discard front links (retain last in sequence) 9 links

Data Structure: TSFSL Requirements for ray casting Query all faces of a cell Query neighouring cell across a face Query vertices of a face

Data Structure: TSFSL TSFSL storage Interleave mesh connectivity and face geometry Back links stored in front of face geometry Terminating front link stored at end of sequence (sequence terminator) Entire mesh stored in single 1D array f bl c d e f fl Sequence [cde] f bl a f f fl Sequence [af] f bl b f fl Sequence [b]

Data Structure: TSFSL Requirements for ray casting Query all faces of a cell Query neighouring cell across a face Query vertices of a face

GPU based Ray Casting TSFSL traversal for ray casting blc d efl Sequence [cde] bla ffl Sequence [af] blbfl Sequence [b]

bla ffl GPU based Ray Casting TSFSL traversal for ray casting blc d efl Sequence [cde] Sequence [af] blbfl Sequence [b]

GPU based Ray Casting Spatial subdivision based on kD-tree Bricks rasterized independently Depth peeling for non-convex meshes Mean-value interpolation within cells Ray casting performed in view space See paper for additional details

Application Examples Hardware: Core 2 2.8GHz Geforce GTX480 1GB RAM HAVS [Callahan 2005]: ~7-9 byte/tet GPU and byte/tet CPU Tet Strips [Weiler 2004]: ~15 byte/tet Cells/Faces1.5M/4.7M1.3M/8.9M Tetrahedra17M89M Byte/Tetrahedra8.5 byte/tet7.5 byte/tet Bricks/Overhead4/1.7%10/8.6% Render Time (preview)222ms (81ms)2.9s (742ms)

Summary/Future Work TSFSL data structure Face based Low memory footprint GPU-based ray-casting on polyhedral meshes Works directly on TSFSL Domain decomposition for culling/depth peeling Future Work Utilize CUDA/OpenCL shared memory during ray-casting Parallelize across multiple GPUs

Questions? Thank you for your attention! Acknowledgements: Polyhedral datasets courtesy of CD-Adapco Cooling jacket and Diesel Particulate Filter datasets courtesy of AVL List GmbH, Graz, Austria Parts of this project have been funded by the Austrian Research Funding Agency (FFG) in the scope of the project AutARG (No ) and the ScaleVS (WWTF) project