1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC.

Slides:



Advertisements
Similar presentations
Reconstruction from Voxels (GATE-540)
Advertisements

VIS Group, University of Stuttgart Tutorial T4: Programmable Graphics Hardware for Interactive Visualization Pre-Integrated Splatting (Stefan Roettger)
Exploration of bump, parallax, relief and displacement mapping
Text Scaffolds for Effective Surface Labeling Gregory Cipriano and Michael Gleicher.
Cubic Curves CSE167: Computer Graphics Instructor: Steve Rotenberg UCSD, Fall 2006.
The Discrete Ray-casting Algorithm Qiang Xue Jiaoying Shi State Key Lab Of CAD&CG Zhejiang University.
By: Bryan Bonvallet Nikolla Griffin Advisor: Dr. Jia Li
Lecture 29 of 42 Bezier Curves and Splines Wednesday, 02 April 2008
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
1 Computer Graphics Chapter 7 3D Object Modeling.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Rasterization and Ray Tracing in Real-Time Applications (Games) Andrew Graff.
HCI 530 : Seminar (HCI) Damian Schofield.
An Efficient Representation for Irradiance Environment Maps Ravi Ramamoorthi Pat Hanrahan Stanford University.
18.1 Si31_2001 SI31 Advanced Computer Graphics AGR Lecture 18 Image-based Rendering Light Maps What We Did Not Cover Learning More...
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
A Personal Surround Environment: Projective Display with Correction for Display Surface Geometry and Extreme Lens Distortion Tyler Johnson, Florian Gyarfas,
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Accelerating Marching Cubes with Graphics Hardware Gunnar Johansson, Linköping University Hamish Carr, University College Dublin.
Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore.
Disediakan oleh Suriati bte Sadimon GMM, FSKSM, UTM Graphics modeling.
Shading Languages By Markus Kummerer. Markus Kummerer 2 / 19 State of the Art Shading.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
Volume Rendering & Shear-Warp Factorization Joe Zadeh January 22, 2002 CS395 - Advanced Graphics.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Continuous Scatter Plot Paper by: Sven Bachthaler and Daniel Weiskopf Presented by: Ayan Biswas.
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
Interactive Visualization of Volumetric Data on Consumer PC Hardware: Introduction Daniel Weiskopf Graphics Hardware Trends Faster development than Moore’s.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
Procedural terrain on the GPU Chalmers University of Technology Advanced computer graphics – DAT205 David Sundelius Adam Scott.
COMP 175: Computer Graphics March 24, 2015
Technology and Historical Overview. Introduction to 3d Computer Graphics  3D computer graphics is the science, study, and method of projecting a mathematical.
Stefan Roettger University of Stuttgart A Two-Step Approach for Interactive Pre-Integrated Volume Rendering of Unstructured Grids VolVis '02 A Two-Step.
Graphics Graphics Korea University cgvr.korea.ac.kr Creating Virtual World I 김 창 헌 Department of Computer Science Korea University
KinectFusion : Real-Time Dense Surface Mapping and Tracking IEEE International Symposium on Mixed and Augmented Reality 2011 Science and Technology Proceedings.
Lecture 3 : Direct Volume Rendering Bong-Soo Sohn School of Computer Science and Engineering Chung-Ang University Acknowledgement : Han-Wei Shen Lecture.
Interactive Rendering of Meso-structure Surface Details using Semi-transparent 3D Textures Vision, Modeling, Visualization Erlangen, Germany November 16-18,
Computer Graphics An Introduction. What’s this course all about? 06/10/2015 Lecture 1 2 We will cover… Graphics programming and algorithms Graphics data.
Interactive Time-Dependent Tone Mapping Using Programmable Graphics Hardware Nolan GoodnightGreg HumphreysCliff WoolleyRui Wang University of Virginia.
University of Coimbra Reconstruction of Voxels from Sensor Data Ricardo Martins Coimbra, 19 th January 2010 Doctoral Programme in Electrical Engineering.
Surface displacement, tessellation, and subdivision Ikrima Elhassan.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
CMSC 635 Volume Rendering. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
Volume Rendering CMSC 491/635. Volume data  3D Scalar Field: F(x,y,z) = ?  Implicit functions  Voxel grid  Scalar data  Density  Temperature  Wind.
Tone Mapping on GPUs Cliff Woolley University of Virginia Slides courtesy Nolan Goodnight.
Real-time Rendering of Heterogeneous Translucent Objects with Arbitrary Shapes Stefan Kinauer KAIST (Korea Advanced Institute of Science and Technology)
3D Object Representations
View-dependent Adaptive Tessellation of Spline Surfaces
Volume Visualization Presented by Zhao, hai. What’ volume visualization Volume visualization is the creation of graphical representations of data sets.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
- Laboratoire d'InfoRmatique en Image et Systèmes d'information
Advanced Computer Graphics Spring 2014 K. H. Ko School of Mechatronics Gwangju Institute of Science and Technology.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Discontinuous Displacement Mapping for Volume Graphics, Volume Graphics 2006, July 30, Boston, MA Discontinuous Displacement Mapping for Volume Graphics.
Me, VANGOGH, and Game Development. Me Started at UMBC in 2002 (CMSC104) Undergraduate Research in DIADIC lab (data mining) Received BS in CMSC, 2006 (Minors.
CS559: Computer Graphics Final Review Li Zhang Spring 2010.
CS 450: Computer Graphics PARAMETRIC SPLINES AND SURFACES
Application: Multiresolution Curves Jyun-Ming Chen Spring 2001.
COMPUTER GRAPHICS CS 482 – FALL 2015 SEPTEMBER 29, 2015 RENDERING RASTERIZATION RAY CASTING PROGRAMMABLE SHADERS.
Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.
Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12.
Solid Modeling Dr. Scott Schaefer.
67 x 89 = ? 67 x
APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.
A novel approach to visualizing dark matter simulations
ICG Syllabus 1. Introduction 2. Viewing in 3D and Graphics Programming
Introduction to Graphics Modeling
ATCM 6317 Procedural Animation
Procedural Animation Lecture 10: Volume simulation
Overview of Modeling 김성남.
Presentation transcript:

1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC

2 Overview Introduction and Previous Work Background Volume Reconstruction Bezier Tetrahedra BT Volumes Definition Function Fitting Reconstruction Rendering Results and Conclusions

3 Introduction Isosurface rendering is important in many applications Medical visualization Chemistry Marching Cubes is the most popular interactive technique Very fast, BUT Low quality reconstruction Marching Cubes rendering

4 Introduction (cont) BT Volumes can do better than MC Interactive frame rates Isosurface level changed on the fly High-quality reconstruction Many filters possible BT Volume rendering

5 Previous Work Lorensen et al. “Marching cubes: A High-Resolution 3D Surface Construction Algorithm” SIGGRAPH ’87 Marschner and Lobb. “An evaluation of Reconstruction Filters for Volume Rendering” Vis ’94: Proceedings of the conference on Visualization ’94 Parker et al. “Interactive Ray Tracing for Volume Visualization” IEEE Transactions on Visualization and Computer Graphics Rossl et al. “Visualization of Volume Data with Quadratic Super Splines” VIS. ’03: Proceedings of the 14 th IEEE Visualization”

6 Overview Introduction and Previous Work Background Volume Reconstruction Bezier Tetrahedra BT Volumes Definition Function Fitting Reconstruction Rendering Results and Conclusions

7 Background Discrete Convolution is the mathematical tool used to reconstruct a continuous function from a discrete sampling The Filter Kernel is a function used to combine sample points from a scalar volume

8 Bezier Tetrahedra Cubic Bezier Tetrahedra are a family of Bezier solids defined by a tetrahedron T and a set of 20 weights BT can be rendered quickly using graphics hardware Loop and Blinn, “Real-Time GPU Rendering of Piecewise Algebraic Surfaces” (Siggraph Proceedings, Boston, 2006)

9 Overview Introduction and Previous Work Background Volume Reconstruction Bezier Tetrahedra BT Volumes Definition Function Fitting Reconstruction Rendering Results and Conclusions

10 BT Volumes - Overview We introduce the BT Volume Piecewise-defined continuous 3D function Tetrahedral grid of Bezier Tetrahedra BT Volumes allow: Direct volume fitting Exact filtering with approximated filters Interactive rendering of isosurfaces

11 BT Volumes - Definition In order to define a BT Volume we need to create a tetrahedral partition We use a special mapping to define how each voxel divides into tetrahedra must be applied in exactly the same way to each voxel The result is a shift invariant partition of 3D space We can create a continuous function by associating BT weights with each tetrahedron

12 BT Volumes - Fitting We can construct BT Volumes by approximating existing 3D functions We used simple least-squares method We used the a 6-tetrahedron function for our work

13 BT Volumes - Reconstruction We could use direct fitting on a large volume, but it is impractical A better technique is to fit a reconstruction filter as a BT Volume The filter will be much smaller than the volume Convolution of a BT Volume with a discrete scalar volume will produce another BT Volume The resulting BT Volume will retain the characteristics of the reconstruction filter

14 BT Volumes - Reconstruction This works because the function enforces that all BT in the same relative position will line up correctly Convolution will be the summation of scaled BT

15 Only this will depend on (a,b,c) BT Volumes - Reconstruction Why does this work? Consider volume reconstruction within an arbitrary tetrahedron, T New weight term

16 BT Volumes - Rendering We can render the BT Volume interactively using the method devised by Loop and Blinn Generate the BT Volume Store each Bezier Tetrahedron as a single vertex Geometry shader creates screen- space triangles Pixel shader solves for particular isosurface

17 Overview Introduction and Previous Work Background Volume Reconstruction Bezier Tetrahedra BT Volumes Definition Function Fitting Reconstruction Rendering Results and Conclusions

18 Results Molecule (64 3 ) Engine (128 3 ) Bucky ball (32 3 )

19 Results We are able to render BT Volumes up to 64 3 interactively BT Volumes do require a lot of space NVIDIA 8800 GTS

20 Results Video

21 Conclusions We have presented BT Volumes as a volume representation format capable of: Direct function fitting Convolution filtering Interactive rendering Future work: Examination of more expressive functions Analysis of filter approximations Compression/storage methods

22 Questions? Acknowledgements The Volume Library provided volume data sets (www9.informatik.uni-erlangen.de/External/vollib/ ) Dr. Alark Joshi and Jesus Caban for their support The entire VANGOGH lab at UMBC for their help This work was funded in part by NSF grant

23 Let be the positions of the vertices of the tetrahedron and be the weights. Then we can transform a point in Euclidian space into barycentric space by Bezier Tetrahedra (cont) Cubic Bezier Tetrahedra are a family of Bezier solids defined by a tetrahedron and a set of 20 weights and the Bezier Tetrahedron is defined as Loop and Blinn, “Real-Time GPU Rendering of Piecewise Algebraic Surfaces” (Siggraph Proceedings, Boston, 2006)

24 BT Volumes - Rendering We can exploit properties of the volume and BT to get early-out tests for the pixel shader Store the minimum and maximum BT weight values for the filter with each tetrahedron If the current isosurface level is not within that range, we don’t have to proceed any further for that tetrahedron Space requirements: 2 floating point values per tetrahedra Speedup: Variable. If the volume has empty space, this will speed rendering up considerably

25 Proof: Lets take the inverse transform so becomes and therefore when we have a constant term which can combine with c BT Volumes - Rendering Changing isosurface level How can we render any isosuface level? We want a space where the polynomial has a constant term which can ‘absorb’ the constant Euclidian space works for this purpose