volume rendering volume rendering isosurface generation
play

Volume Rendering Volume Rendering Isosurface Generation Isosurface - PowerPoint PPT Presentation

Jan 25, 2024 •598 likes •1.78k views

Visualization Techniques Visualization Techniques Volume Rendering Volume Rendering Isosurface Generation Isosurface Generation Cludio T. Silva Cludio T. Silva Outline Introduction to Volume Rendering Out-Of-Core Techniques

  1. A Simple Memory-Insensitive Technique X , Y , Z Data 0 0 0 X , Y , Z n 1 1 1 vertices Dereferenced X , Y , Z n n n Sampling I , I , I , I 00 01 03 02 I , I , I , I Sorted t 10 11 12 13 tetrahedra Compose I , I , I , I t0 t3 t1 t2 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  2. Data XYZ XYZ XYZ XYZ 00 01 02 03 XYZ XYZ XYZ XYZ Dereferenced 10 11 12 13 Sampling XYZ XYZ XYZ XYZ t0 t1 t2 t3 Sorted Compose Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  3. Data Dereferenced Pix Z Alpha 0 Pix Z Alpha Sampling 1 Sorted Pix Z Alpha P Compose Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  4. Data Dereferenced Pix Z Alpha 0` Pix Z Alpha Sampling 1` Sorted Pix Z Alpha P` Compose Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  5. Data Dereferenced Projected Sorted Compose Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  6. Features of Memory-Insensitive Algorithm • Dataset can be arbitrarily large • Easily to implement • Cell intersection code • Sample Integration code • External Memory sort • Transfer function modifications for same viewpoint are fast! (also for time-varying data) Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  7. Complexity Analysis N-by-N pixels c cells Number of Intersections: O(c N 2 ) 1. Time: sorting intersections takes too long! Problems: 2. Memory: storage too high! Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  8. Sorting Application Object-Space Sorting Rasterization Image-Space Sorting Display Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  9. Approximate Object-Space Sorting 1 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  10. 1 2 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  11. 3 1 2 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  12. 3 5 1 4 2 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  13. 3 6 7 5 1 4 2 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  14. 3 7 6 5 1 4 2 A Solution: Use an insertion Use an insertion- -sort A sort A- -buffer! buffer! A Solution: Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  15. 3 7 6 5 1 4 2 What about the space problem space problem ? ? What about the � Use a conservative bound on the intersections � Use a conservative bound on the intersections Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  16. ZSWEEP: Sort in Image and Object Space Do an approximate sorting of the cells (e.g., based on the order of the vertices), and use an insertion sort for the intersections – solves the sorting overhead Propose a conservative technique for limiting the memory usage, by performing compositing on the intersections, anytime the lists become “too large” – solves the memory overhead Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  17. ZSWEEP - DEMO Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  18. Blocking for Out-Of-Core Rendering Meta- -cell cell Meta Chiang, Silva, Schroeder 1998 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  19. Out-Of-Core ZSWEEP: Data Management [Farias Farias and Silva 2001a] and Silva 2001a] [ dump B fetch B Meta-cell dump A Sweep Plane Event: fetch A Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  20. Tile-Based ZSWEEP SGI R10K L2 – 2MB ZSWEEP: 56% hit rate TB-ZSWEEP: 94% hit rate Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  21. Out-Of-Core ZSWEEP Results Generating 2048x2048 Image (sec) Original ZSWEEP OOC-ZSWEEP Memory Time Memory Time Blunt Fin 330 331 386 6.2 Combustion Chamber 330 407 423 6.2 Oxygen Post 350 775 667 13.2 Delta Wing 380 639 24.2 537 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  22. Video QuickTime™ and a Photo decompressor are needed to see this picture. Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  23. Outline • Introduction to Volume Rendering • Out-Of-Core Techniques • Introduction to External Memory Algorithms • Isosurface Generation • Direct Volume Rendering • Hardware-Assisted Techniques • Introduction to Programmable Hardware • Direct Volume Rendering • Isosurface Generation (remarks) Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  24. Hardware-Assisted Volume Rendering • Introduction to Programmable Hardware • Texture-Based Volume Rendering • Rendering Unstructured Grids Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  25. Introduction to Programmable Hardware • Graphics Pipeline • Programmable Graphics Pipeline Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  26. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  27. Graphics Pipeline Joao Comba, UFRGS glBegin(GL_TRIANGLES); 3D Application glVertex3f(0.0,0.0,0.0); or Game glVertex3f(1.0,0.0,0.0); 3D API commands glVertex3f(0.5,1.0,0.0); 3D API: ... OpenGL or glEnd(); Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  28. Graphics Pipeline Joao Comba, UFRGS 1 3D Application or Game 3D API commands 4 2 3D API: OpenGL or Direct 3D Vertices 3 Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  29. Graphics Pipeline Joao Comba, UFRGS 1 3D Application or Game 3D API commands 4 2 3D API: OpenGL or Direct 3D 4 Vertices 3 3 1 1 2 3 Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  30. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D 4 Vertices 3 1 1 2 3 Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster Vertex FB and Rasterization and Coloring Operations Transformation Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  31. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices 4 2 3 1 3 Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster Vertex FB and Rasterization and Coloring Operations Transformation 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  32. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices 3 1 3 4 Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster Vertex FB and Rasterization and Coloring Operations Transformation 2’ 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  33. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices 1 3 4 Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster Vertex FB and Rasterization and Coloring Operations Transformation 3’ 2’ 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  34. Graphics Pipeline Joao Comba, UFRGS 1’ 3D Application or Game 3D API commands 2’ 3D API: OpenGL or Direct 3D Vertices 3’ 1 3 4 Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  35. Graphics Pipeline Joao Comba, UFRGS 1’ 3D Application or Game 3D API commands 2’ 3D API: OpenGL or Direct 3D Vertices 3’ 1 3 4 Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  36. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored 3 4 Pixel Fragments Transformed Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  37. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored 4 Pixel Fragments Transformed Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations 3’ 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  38. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Fragments Transformed Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations 4’ 3’ 1’ Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  39. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  40. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  41. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  42. Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  43. Graphics Pipeline: Parallelization Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices 1 Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations 2 Vertex Transformation 3 Vertex Transformation Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  44. Graphics Pipeline: Parallelization Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D Vertices Transformed Colored Pixel Vertices Fragments Fragments Updates 1’ Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations 2’ Vertex Transformation 3’ Vertex Transformation Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  45. Graphics Pipeline: Parallelization Joao Comba, UFRGS 3D Application or Game 3D API commands Fragment Texturing 3D API: and Coloring OpenGL or Direct 3D Fragment Texturing and Coloring Vertices Fragment Texturing Pixel Colored Transformed Fragments and Coloring Fragments Updates Vertices Fragment Texturing Raster Vertex Primitive Assembly FB Operations and Coloring Transformation and Rasterization Fragment Texturing and Coloring Fragment Texturing and Coloring Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  46. Graphics Pipeline: Parallelization Joao Comba, UFRGS 3D Application or Game 3D API commands Fragment Texturing 3D API: and Coloring OpenGL or Direct 3D Fragment Texturing and Coloring Vertices Fragment Texturing Pixel Colored Transformed Fragments and Coloring Fragments Updates Vertices Fragment Texturing Raster Vertex Primitive Assembly FB Operations and Coloring Transformation and Rasterization Fragment Texturing and Coloring Fragment Texturing and Coloring Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  47. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Vertex Primitive Assembly Fragment Texturing Raster FB Transformation and Rasterization and Coloring Operations Programmable Program Vertex Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  48. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster FB and Rasterization and Coloring Operations Vertex Processor Program Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  49. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Fragment Texturing Primitive Assembly Raster FB and Rasterization and Coloring Operations Vertex Processor Programmable Fragment Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah Program

  50. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Raster Primitive Assembly FB Operations and Rasterization Fragment Vertex Processor Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah Program

  51. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Fragment Processor Raster Primitive Assembly FB Operations and Rasterization Fragment Processor Vertex Processor Fragment Processor Fragment Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah Program

  52. Graphics Pipeline: The Big Picture Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Raster Primitive Assembly FB Operations and Rasterization Fragment Processor Vertex Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  53. Graphics Pipeline: The Big Picture Joao Comba, UFRGS 3D Application GPU is a stream processor or Game • Multiple programmable processing 3D API commands units 3D API: • Connected by data flows OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Raster Primitive Assembly FB Operations and Rasterization Fragment Vertex Processor Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  54. Programmable Graphics Pipeline Joao Comba, UFRGS 3D Application or Game 3D API commands 3D API: OpenGL or Direct 3D CPU – GPU Boundary Vertices Colored Pixel Transformed Fragments Fragments Updates Vertices Primitive Assembly Fragment Texturing Raster FB Vertex Processor and Rasterization and Coloring Operations Vertex Processor Vertex Processor Program Vertex Processor Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  55. Texture-Based Volume Rendering Slice Rendering of Decom position Final I m age textures slices (Proxy Geometry) Trilinear Com positing Hardw are ( Blending) I nterpolation Rezk-Salama Visualization 2002 Tutorial Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  56. Rendering Unstructured Grids Brian Wylie, Sandia CPU GPU Cell Contribution Visibility Sort Programmable for each cell in order Hardware find thickest Software model with cell distance decompose millions of cells to triangles compute compute each cell’s screen triangle’s projection parameters graphics card final image of model PC (CPU) Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  57. Visibility Sorting B 7 5 6 A 3 4 2 p 1 A < B p Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  58. Williams’ MPVO Idea: Define ordering relations B < A by looking at shared faces. A < C B < E D D C < E C < D C C A A F F E < F B B D < F E E Viewing direction Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  59. Shirley-Tuchman (ST) Algorithm Brian Wylie, Sandia Class 1 Class 2 Class 3 Class 4 Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  60. Wylie et al’s GPU-based ST Brian Wylie, Sandia Moves all of the following functions from the CPU the GPU: • Transform to screen space • Determine projection class • Calculate thick vertex location • Determine depth at thick vertex • Compute color and opacity for thick vertex • Apply exponential attenuation texture Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  61. GPU Limitations Brian Wylie, Sandia � Each instance of a vertex shader program works independently on a single vertex in SIMD fashion � No support dynamic vertex creation or topology modification within the vertex program � No branching � No knowledge of neighboring vertices � Cannot change execution based on past information Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

  62. Idea: Morph a Canonical Graph Brian Wylie, Sandia V 2 ’ V 4 ’ V 3 ’ V 1 ’ V 0 ’ Basis Graph Isomorphic to all projection cases Example later… Scientific Computing and Imaging Institute, University of Utah Scientific Computing and Imaging Institute, University of Utah

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Computer Graphics - Volume Rendering - Philipp Slusallek Overview Motivation Volume

Computer Graphics - Volume Rendering - Philipp Slusallek Overview Motivation Volume

Computer Graphics - Volume Rendering - Philipp Slusallek Overview Motivation Volume Representation Indirect Volume Rendering Volume Classification Direct Volume Rendering Applications: Bioinformatics Image by [Chimera 08]

627 views • 44 slides
Direct Volume Rendering Han-Wei Shen The Ohio State University Volume Rendering A method to

Direct Volume Rendering Han-Wei Shen The Ohio State University Volume Rendering A method to

Direct Volume Rendering Han-Wei Shen The Ohio State University Volume Rendering A method to visualize the en?re 3D data set by simula?ng light transport across the volume A 2D projec?on of 3D discrete samples Direct Volume Rendering

728 views • 27 slides
1 Volume Graphics - Pros Volume Graphics - Cons Advantages: Disadvantages: Required

1 Volume Graphics - Pros Volume Graphics - Cons Advantages: Disadvantages: Required

Overview Volume Rendering Surface graphics is not enough for ... Introduction to volume graphics Volume rendering techniques Lecture 21 Contour surfaces Ray Casting Cell Projection Slides gathered from Roger Crawfis ,

670 views • 12 slides
Raycasting SciVis 2008 - Raycasting Ronald Peikert Direct volume rendering Volume rendering

Raycasting SciVis 2008 - Raycasting Ronald Peikert Direct volume rendering Volume rendering

3-1 Raycasting SciVis 2008 - Raycasting Ronald Peikert Direct volume rendering Volume rendering (sometimes called direct volume rendering) stands for methods that generate images directly from 3D scalar data. &quot;Directly&quot; means: no

566 views • 35 slides
Raycasting SciVis 2007 - Raycasting Ronald Peikert Direct volume rendering Volume rendering

Raycasting SciVis 2007 - Raycasting Ronald Peikert Direct volume rendering Volume rendering

3-1 Raycasting SciVis 2007 - Raycasting Ronald Peikert Direct volume rendering Volume rendering (sometimes called direct volume rendering) stands for methods that generate images directly from 3D scalar data. &quot;Directly&quot; means: no

726 views • 35 slides
Object Space Volume Rendering 4-1 Ronald Peikert SciVis 2007 - Object Space Volume Rendering

Object Space Volume Rendering 4-1 Ronald Peikert SciVis 2007 - Object Space Volume Rendering

Object Space Volume Rendering 4-1 Ronald Peikert SciVis 2007 - Object Space Volume Rendering Object space volume rendering In object space rendering methods, the main loop is not over the pixels but over the objects in 3-space. In the case of

949 views • 30 slides
Object Space Volume Rendering Object Space Volume Rendering Ronald Peikert SciVis 2010 - Object

Object Space Volume Rendering Object Space Volume Rendering Ronald Peikert SciVis 2010 - Object

Object Space Volume Rendering Object Space Volume Rendering Ronald Peikert SciVis 2010 - Object Space Volume Rendering 4-1 Object space volume rendering In object space rendering methods, the main loop is not over the pixels but over the

483 views • 30 slides
1 Texture Mapping (2) Tex. Mapping for Volume Rendering (0,1) (1,1) Remember ray casting

1 Texture Mapping (2) Tex. Mapping for Volume Rendering (0,1) (1,1) Remember ray casting

Texture-based Volume Rendering Texture Mapping Volume rendering by ray casting is time- Modern graphics hardware includes facility to draw a consuming textured polygon one ray per pixel The texture is an image with each ray

538 views • 6 slides
Comp/Phys/Mtsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured)

Comp/Phys/Mtsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured)

2/16/2012 Comp/Phys/Mtsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured) Isosurfaces, Glyphs 2/16/2012 Volume Comp/Phys/Mtsc 715 Taylor Example Videos Vis08-TbTFs: Texture-based volume rendering Confocal

429 views • 30 slides
6. Direct Volume Rendering Directly get a 3D representation of the volume data The data is

6. Direct Volume Rendering Directly get a 3D representation of the volume data The data is

6. Direct Volume Rendering Directly get a 3D representation of the volume data The data is considered to represent a semi- transparent light-emitting medium Also gaseous phenomena can be simulated Approaches are based on the

787 views • 53 slides
Comp/Phys/Apsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured)

Comp/Phys/Apsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured)

2/6/2014 Comp/Phys/Apsc 715 3D (Volume) Scalar Fields: Direct volume rendering, Slices, (Textured) Isosurfaces, Glyphs 2/6/2014 Volume Comp/Phys/Apsc 715 Taylor Example Videos Confocal visualization tool Rendering surfaces as peaks in

462 views • 30 slides
- Volume Rendering - Pascal Grittmann, Jaroslav K ivnek Using pictures from: Monte Carlo

- Volume Rendering - Pascal Grittmann, Jaroslav K ivnek Using pictures from: Monte Carlo

Computer Graphics - Volume Rendering - Pascal Grittmann, Jaroslav K ivnek Using pictures from: Monte Carlo Methods for Physically Based Volume Rendering ; SIGGRAPH 2018 Course; Jan Novk, Iliyan Georgiev, Johannes Hanika, Jaroslav Kivnek ,

732 views • 47 slides
- Volume Rendering - Pascal Grittmann Philipp Slusallek Using pictures from: Monte Carlo Methods

- Volume Rendering - Pascal Grittmann Philipp Slusallek Using pictures from: Monte Carlo Methods

Computer Graphics - Volume Rendering - Pascal Grittmann Philipp Slusallek Using pictures from: Monte Carlo Methods for Physically Based Volume Rendering ; SIGGRAPH 2018 Course; Jan Novk, Iliyan Georgiev, Johannes Hanika, Jaroslav Kivnek ,

1.13k views • 50 slides
VoRMD VOLUME RENDERING ON MOBILE DEVICES Goal Volume

VoRMD VOLUME RENDERING ON MOBILE DEVICES Goal Volume

VoRMD VOLUME RENDERING ON MOBILE DEVICES Goal Volume renderer on an Android device OpenGL ES 2.0 VS. WebGL

544 views • 22 slides
Volume Rendering Reference Material The slides have used/adapted material from the following

Volume Rendering Reference Material The slides have used/adapted material from the following

Volume Rendering Reference Material The slides have used/adapted material from the following references: 1. Advanced Animation and Rendering Techniques by Watt and Watt 2. Slides by Prof Parag Chaudhuri of Course CS 775 on Volume Graphics 3.

1.02k views • 73 slides
Volume Visualization Overview: Volume Visualization (1) Introduction to volume visualization On

Volume Visualization Overview: Volume Visualization (1) Introduction to volume visualization On

Volume Visualization Overview: Volume Visualization (1) Introduction to volume visualization On volume data Voxels vs. cells Interpolation Gradient Classification Transfer Functions (TF) Slice vs surface vs. volume rendering Overview:

1.35k views • 99 slides
Shortest Paths Dijkstras algorithm implementation negative weights References:

Shortest Paths Dijkstras algorithm implementation negative weights References:

Shortest Paths Dijkstras algorithm implementation negative weights References: Algorithms in Java, Chapter 21 http://www.cs.princeton.edu/introalgsds/55dijkstra 1 Edsger W. Dijkstra: a few select quotes The question of whether

483 views • 47 slides
The Asphericity of Injective Labeled Oriented Trees Stephan Rosebrock Pdagogische Hochschule

The Asphericity of Injective Labeled Oriented Trees Stephan Rosebrock Pdagogische Hochschule

The Asphericity of Injective Labeled Oriented Trees Stephan Rosebrock Pdagogische Hochschule Karlsruhe Germany Stephan Rosebrock (PH Karlsruhe) The Asphericity of Injective LOTs 1 / 32 Introduction Introduction Joint work with Jens

1.21k views • 93 slides
The Buss Reduction for the k -Weighted Vertex Cover Problem Hong Xu Xin-Zeng Wu Cheng Cheng

The Buss Reduction for the k -Weighted Vertex Cover Problem Hong Xu Xin-Zeng Wu Cheng Cheng

The Buss Reduction for the k -Weighted Vertex Cover Problem Hong Xu Xin-Zeng Wu Cheng Cheng Sven Koenig T. K. Satish Kumar {hongx, xinzengw, chen260, skoenig}@usc.edu tkskwork@gmail.com January 5, 2018 University of Southern California, Los

327 views • 29 slides
Digital Geometry Processing Algorithms for Representing, Analyzing and Comparing 3D shapes Today

Digital Geometry Processing Algorithms for Representing, Analyzing and Comparing 3D shapes Today

Digital Geometry Processing Algorithms for Representing, Analyzing and Comparing 3D shapes Today Previous lecture summary Triangle mesh basics Shape Simplification Shape Subdivision Last Time Registration registered point

1.24k views • 107 slides
Towards Effective Partition Management for Large Graphs Shengqi Yang, Xifeng Yan, Bo Zong and

Towards Effective Partition Management for Large Graphs Shengqi Yang, Xifeng Yan, Bo Zong and

Towards Effective Partition Management for Large Graphs Shengqi Yang, Xifeng Yan, Bo Zong and Arijit Khan (UC Santa Barbara) Presenter: Xiao Meng Motivation - How to manage large graphs? Increasing demand for large graph management on

430 views • 30 slides
HelP: High-level Primitives for Large- Scale Graph Processing Semih Salihoglu Stanford

HelP: High-level Primitives for Large- Scale Graph Processing Semih Salihoglu Stanford

HelP: High-level Primitives for Large- Scale Graph Processing Semih Salihoglu Stanford University Jennifer Widom Stanford University 1 Large-scale Graph Processing 10s or 100s billion vertices and edges Distributed Shared-Nothing

658 views • 16 slides
Explicit realization of affine vertex algebras and their applications Dra zen Adamovi c

Explicit realization of affine vertex algebras and their applications Dra zen Adamovi c

Notre Dame 2015 Explicit realization of affine vertex algebras and their applications Dra zen Adamovi c University of Zagreb, Croatia Supported by CSF, grant. no. 2634 Conference on Lie algebras, vertex operator algebras and related

586 views • 39 slides
Model Checking Lower Bounds for Simple Graphs Michael Lampis KTH Royal Institute of Technology

Model Checking Lower Bounds for Simple Graphs Michael Lampis KTH Royal Institute of Technology

Model Checking Lower Bounds for Simple Graphs Michael Lampis KTH Royal Institute of Technology July 8th, 2013 Algorithmic Meta-Theorems Positive results Negative results Problem X is tractable. Problem X is hard. Model Checking Lower

912 views • 62 slides

More recommend