Continuous Scatter Plot Paper by: Sven Bachthaler and Daniel Weiskopf Presented by: Ayan Biswas.

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)
Direct Volume Rendering. What is volume rendering? Accumulate information along 1 dimension line through volume.
Week 10 - Monday.  What did we talk about last time?  Global illumination  Shadows  Projection shadows  Soft shadows.
Hank Childs, University of Oregon November 6 th, 2013 Spatial-Based and Variable-Based Selections.
CHAPTER 12 Height Maps, Hidden Surface Removal, Clipping and Level of Detail Algorithms © 2008 Cengage Learning EMEA.
3DSkeleton-based Human Modeling with Metaballs 18 April 2008 Donghun Kim Robot Vision Lab.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
lecture 4 : Isosurface Extraction
Massive Graph Visualization: LDRD Final Report Sandia National Laboratories Sand Printed October 2007.
Surface Simplification & Edgebreaker Compression for 2D Cel Animations Vivek Kwatra & Jarek Rossignac GVU Center, College of Computing Georgia Institute.
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.
Global Illumination May 7, Global Effects translucent surface shadow multiple reflection.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
CHAPTER 7 Viewing and Transformations © 2008 Cengage Learning EMEA.
Scalar and Vector Fields
Computer Graphics Lecture 13 Curves and Surfaces I.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm
CS 450: Computer Graphics REVIEW: OVERVIEW OF POLYGONS
Basics of Rendering Pipeline Based Rendering –Objects in the scene are rendered in a sequence of steps that form the Rendering Pipeline. Ray-Tracing –A.
COMP 175: Computer Graphics March 24, 2015
Dynamic Meshing Using Adaptively Sampled Distance Fields
Interactive Rendering of Meso-structure Surface Details using Semi-transparent 3D Textures Vision, Modeling, Visualization Erlangen, Germany November 16-18,
SURFACE RECONSTRUCTION FROM POINT CLOUD Bo Gao Master’s Thesis December, 2007 Thesis Committee: Professor Harriet Fell Professor Robert Futrelle College.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Unstructured Volume Rendering Jian Huang, CS 594, Spring 2002 This set of slides reference slides developed by Prof. Torsten Moeller, SFU, Canada.
Image Synthesis Rabie A. Ramadan, PhD 1. 2 About my self Rabie A. Ramadan My website and publications
3D Graphics for Game Programming Chapter IV Fragment Processing and Output Merging.
Linear Interpolation (for curve 01).  This chapter discusses straight lines and flat surfaces that are defined by points.  The application of these.
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.
CGMB214: Introduction to Computer Graphics
Stable, Circulation- Preserving, Simplicial Fluids Sharif Elcott, Yiying Tong, Eva Kanso, Peter Schröder, and Mathieu Desbrun.
Computer Graphics 2 Lecture 7: Texture Mapping Benjamin Mora 1 University of Wales Swansea Pr. Min Chen Dr. Benjamin Mora.
Computer Graphics Chapter 6 Andreas Savva. 2 Interactive Graphics Graphics provides one of the most natural means of communicating with a computer. Interactive.
CSE554Fairing and simplificationSlide 1 CSE 554 Lecture 6: Fairing and Simplification Fall 2012.
1Computer Graphics Programming with OpenGL Three Dimensions – 2 Lecture 7 John Shearer Culture Lab – space 2
Binary Space Partitioning Trees Ray Casting Depth Buffering
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
Lapped Solid Textrues Filling a Model with Anisotropic Textures
Volume Visualization Presented by Zhao, hai. What’ volume visualization Volume visualization is the creation of graphical representations of data sets.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Hank Childs, University of Oregon Lecture #10 CIS 410/510: Isosurfacing.
Basic Perspective Projection Watt Section 5.2, some typos Define a focal distance, d, and shift the origin to be at that distance (note d is negative)
Math Vocabulary Keydron Stuckey st Period.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Unstructured Volume Rendering. Grid Types uniformrectilinearregularcurvilinear Structured Grids: regularirregularhybridcurved Unstructured Grids:
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
Fifth International Conference on Curves and Surfaces Incremental Selective Refinement in Hierarchical Tetrahedral Meshes Leila De Floriani University.
CDS 301 Fall, 2008 From Graphics to Visualization Chap. 2 Sep. 3, 2009 Jie Zhang Copyright ©
Advisor : Ku-Yaw Chang Speaker : Ren-Li Shen /6/12.
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
1 Interactive Volume Isosurface Rendering Using BT Volumes John Kloetzli Marc Olano Penny Rheingans UMBC.
A novel approach to visualizing dark matter simulations
Visualization Fundamentals
Rigid Bodies: Equivalent Systems of Forces
CIS 410/510: Isosurfacing (pt 2)
The Graphics Rendering Pipeline
Domain-Modeling Techniques
Procedural Animation Lecture 3: Types of 3D models
Hank Childs, University of Oregon
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Chap 10. Geometric Level of Detail
Presentation transcript:

Continuous Scatter Plot Paper by: Sven Bachthaler and Daniel Weiskopf Presented by: Ayan Biswas

Scatter Plots Powerful for data visualization Notion of continuous scatter plots General mathematical model Common case computation model

Mathematical Model Input field on n-dimensional domain (spatial domain) m-dimensional domain of the scatterplot (data domain) Input field is represented by τ

Mathematical Model contd. Density distribution in Spatial Domain S Density distribution in Data Domain σ Mass conservation

Mathematical Model contd. Case m=n Assuming τ is diffeomorphic We get

Mathematical Model contd. When det(Dτ)=0 – Piecewise constant τ (x)=∑ i τ i χ i (x) where Then we get

When m<n Dimensionality problem Divide the volume V into – Inverse image of ξ 0 i.e. isocontour – Perpendicular space around this isocontour

Case :m<n contd. Then we get Finally we arrive at

Algorithm The algorithm step-by-step: 1. Classify a tetrahedron based on its silhouette in the data domain. 2. Attach data values as 2D geometric coordinates. 3. Determine the volume measure |Vol(Dτ)(x)|. 4. Compute the Euclidean distance between front-face and back-face of the tetrahedron at the vertices. Divide by the volume measure and attach to the vertices. 5. Render triangles with additive blending

My Steps 1.Collected the input dataset. This data set is 3-D(spatial) X 1-D(scalar). 2. Read the input dataset into an array. 3.Calculate the gradient of the input scalar data and store in the array. Now we have 3- D(spatial) X 2-D(scalar) data set as the input. 4.The input mesh is broken into cubes. 5. Each cube is decomposed into six tetrahedrons. (No cracking problem) 6.Now each tetrahedron is projected into data space and is further divided into triangles. 7.Each triangle has 3 points each of which has two scalar values. I calculate the IsoSurfaces for the triangle vertices' scalar values. Inside the tetrahedron, the Isosurface is a triangle. This Isosurface algorithm is written by me.

My Steps.. 8.For each vertex, we have two triangles for the two scalar values. Now I calculate the intersection of the two triangles. This is a straight line. The length of the line is calculated and stored. 9.Volume measure is calculated as the cross product of the gradient of the two scalar values. 10. Divide the line length by volume measure and use this value to look up from a predefined color map and assign the color to the vertex. 11. Using OpenGL, I repeat these steps for all the triangles and their vertices and draw on screen with additive blending.

Results Shockwave.raw (64x64x512) DiscreteContinuous

Results Silicium.raw (34x34x98) DiscreteContinuous

More Results Teddybear.raw (62x128x128) DiscreteContinuous

Conclusion Discrete scatterplot Continuous scatterplot parameter dependent parameter free resolution dependent resolution independency arbitrary data types continuous data sets only fast and simple precomputation takes some time

Thanks..!! Questions?

Author’s Results