CDS 301 Fall, 2009 Scalar Visualization Chap. 5 September 24, 2009 Jie Zhang Copyright ©

Slides:



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

Yingcai Xiao Chapter 6 Fundamental Algorithms. Types of Visualization Transformation Types 1.Data (Attribute Transformation) 2.Topology (Topological Transformation)
Visualization Data Representation Ray Gasser SCV Visualization Workshop – Fall 2008.
CDS 301 Fall, 2009 Image Visualization Chap. 9 November 5, 2009 Jie Zhang Copyright ©
Isocontour/surface Extractions 2D Isocontour 3D Isosurface.
Sheng Bin Data Representation Chapter 3. Continuous Data Sampled Data Discrete Datasets Cell Types vertex, line, triangle, quad, tetrahedron, hexahedron.
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
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
Gopi -ICS186AW03 - Slide1 Graphics Pipeline: First Pass.
Accelerating Marching Cubes with Graphics Hardware Gunnar Johansson, Linköping University Hamish Carr, University College Dublin.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Marching Cubes A High Resolution 3D Surface Construction Algorithm.
Scientific Data Representation and Mapping
Interactive Visualization of Volumetric Data on Consumer PC Hardware: Introduction Daniel Weiskopf Graphics Hardware Trends Faster development than Moore’s.
Volumetric and Blobby Objects Lecture 8 (Modelling)
Scalar Visualization Chap. 5 September 23, 2008 Jie Zhang Copyright ©
CS559: Computer Graphics Lecture 33: Shape Modeling Li Zhang Spring 2008.
CDS 301 Fall, 2009 Data Representation Chap. 3 September 10, 2009 Jie Zhang Copyright ©
CDS 301 Fall, 2009 Vector Visualization Chap. 6 October 7, 2009 Jie Zhang Copyright ©
Scientific Visualization Module 6 Volumetric Algorithms (adapted by S.V. Moore – slides deleted, modified, and added) prof. dr. Alexandru (Alex) Telea.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Segmentation & Modeling ImagesSegmented Images Models.
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.
Spatial Databases: Digital Terrain Model Spring, 2015 Ki-Joune Li.
1 Interactive Thickness Visualization of Articular Cartilage Author :Matej Mlejnek, Anna Vilanova,Meister Eduard GröllerMatej MlejnekAnna VilanovaMeister.
3D Object Representations
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Hank Childs, University of Oregon Lecture #10 CIS 410/510: Isosurfacing.
CSE554FairingSlide 1 CSE 554 Lecture 6: Fairing Fall 2015.
Hank Childs, University of Oregon Lecture #9 CIS 410/510: Advection (Part 4!)
Hank Childs, University of Oregon Isosurfacing (Part 3)
Bump Map 1. High Field Function: H(u, v) New Normal : N’
CDS Fall, 2010 Computing for Scientists Visualization (Oct. 28, 2010 – Nov. 09, 2010) Jie Zhang Copyright ©
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
SCALAR VISUALIZATION. OUTLINE Visualizing scalar data A number of the most popular scalar visualization techniques Color mapping Contouring Height plots.
CDS 301 Fall, 2008 Image Visualization Chap. 9 November 11, 2008 Jie Zhang Copyright ©
Edge Groups: An Approach to Understanding the Mesh Quality of Marching Methods IEEE Transactions on Visualization and Computer Graphics Authors: Carlos.
Data Visualization Fall The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,
CDS 301 Fall, 2008 From Graphics to Visualization Chap. 2 Sep. 3, 2009 Jie Zhang Copyright ©
CDS 301 Fall, 2008 Domain-Modeling Techniques Chap. 8 November 04, 2008 Jie Zhang Copyright ©
Data Visualization Fall Scattered Point Interpolation Fall 2015Data Visualization2 Sometimes, we have no explicit cell information connecting the.
67 x 89 = ? 67 x
CDS 301 Fall, 2008 Data Representation Chap. 3 September 2, 2008 Jie Zhang Copyright ©
Visualization Fundamentals
VTK: The Visualization Toolkit
Terrain Sampled height-field 2D or 3D Shading Segmentation Smoothing
Introduction to Functions of Several Variables
Mapping Earth’s Surface
CIS 410/510: Isosurfacing (pt 2)
Volume Visualization Chap. 10 November 20 , 2008 Jie Zhang Copyright ©
Chapter 5(1) Color MaPPING
Chapter 5(1) Color MaPPING
CSc4730/6730 Scientific Visualization
Volume Visualization Chap. 10 December 3 , 2009 Jie Zhang Copyright ©
Domain-Modeling Techniques
Hank Childs, University of Oregon
Tensor Visualization Chap. 7 October 21, 2008 Jie Zhang Copyright ©
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
From Voxels to 3D Uri Mike.
Spatial Databases: Digital Terrain Model
Spatial Databases: Digital Terrain Model
Presentation transcript:

CDS 301 Fall, 2009 Scalar Visualization Chap. 5 September 24, 2009 Jie Zhang Copyright ©

Recap of Chap 4: Visualization Pipeline 1. Data Importing 2. Data Filtering 3. Data Mapping 4. Date Rendering

Outline 5.1. Color Mapping 5.2. Designing Effective Colormaps 5.3. Contouring 5.4. Height Plots

Scalar Function

Color Mapping color look-up table Associate a specific color with every scalar value The geometry of Dv is the same as D

Luminance Colormap Use grayscale to represent scalar value Luminance Colormap Most scientific data (through measurement, observation, or simulation) are intrinsically grayscale, not color Legend

Rainbow Colormap Red: high value; Blue: low value A commonly used colormap Luminance MapRainbow Colormap

(Continued) Data Representation Chap. 5 October 1, 2009

Rainbow Colormap Construction f<dx: R=0, G=0, B=1 f=2: R=0, G=1, B=1 f=3: R=0, G=1, B=0 f=4: R=1, G=1, B=0 f>6-dx: R=1, G=0, B=0

Rainbow Colormap Implementation void c(float f, float & R, float & G, float &B) { const float dx=0.8 f=(f 1)? 1 : f //clamp f in [0,1] g=(6-2*dx)*f+dx //scale f to [dx, 6-dx] R=max(0, (3-fabs(g-4)-fabs(g-5))/2); G=max(0,(4-fabs(g-2)-fabs(g-4))/2); B=max(0,(3-fabs(g-1)-fabs(g-2))/2); }

Colormap: Designing Issues Choose right color map for correct perception Grayscale: good in most cases Rainbow: e.g., temperature map Rainbow + white: e.g., landscape Blue: sea, lowest Green: fields Brown: mountains White: mountain peaks, highest

Rainbow Colormap

Exp: Earth map

Exp: Sun in green-white colormap

Exp: Coronal loop

Color Banding Effect Caused by a small number of colors in a look-up table

Contouring A contour line C is defined as all points p in a dataset D that have the same scalar value, or isovalue s(p)=x A contour line is also called an isoline In 3-D dataset, a contour is a 2-D surface, called isosurface

Contouring Cartograph

Contouring One contour at s=0.11 S > 0.11S < 0.11 Contouring and Color Banding

Contouring 7 contour lines Contouring and Colormapping: Show (1) the smooth variation and (2) the specific values

Properties of Contours Indicating specific values of interest In the height-plot, a contour line corresponds with the interaction of the graph with a horizontal plane of s value

Properties of Contours The tangent to a contour line is the direction of the function’s minimal (zero) variation The perpendicular to a contour line is the direction of the function’s maximum variation: the gradient Contour lines Gradient vector

Constructing Contours V=0.48 Finding line segments within cells

Constructing Contours For each cell, and then for each edge, test whether the isoline value v is between the attribute values of the two edge end points (v i, v j ) If yes, the isoline intersects the edge at a point q, which uses linear interpolation For each cell, at least two points, and at most as many points as cell edges Use line segments to connect these edge-intersection points within a cell A contour line is a polyline.

Constructing Contours V=0.37: 4 intersection points in a cell -> Contour ambiguity

Implementation: Marching Squares Determining the topological state of the current cell with respect to the isovalue v Inside state (1): vertex attribute value is less than isovalue Outside state (0): vertex attribute value is larger than isovalue A quad cell: (S 3 S 2 S 1 S 0 ), 2 4 =16 possible states (0001): first vertex inside, other vertices outside Use optimized code for the topological state to construct independent line segments for each cell Merge the coincident end points of line segments originating from neighboring grid cells that share an edge

Topological State of a Quad Cell Implementation: Marching Squares

Topological State of a hex Cell Implementation: Marching Cube Marching cube generates a set of polygons for each contoured cell: triangle, quad, pentagon, and hexagon

Contours in 3-D In 3-D scalar dataset, a contour at a value is an isosurface Isosurface for a value corresponding to the skin tissue of an MRI scan voxels

Contours in 3-D Two nested isosurface: the outer isosurface is transparent

Height Plots The height plot operation is to “warp” the data domain surface along the surface normal, with a factor proportional to the scalar value

Height Plots Height plot over a planar 2-D surface

Height Plots Height plot over a nonplanar 2-D surface

End of Chap. 5