Visualization Fundamentals

Slides:



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

8.1 Prisms, Area and Volume Prism – 2 congruent polygons lie in parallel planes corresponding sides are parallel. corresponding vertices are connected.
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Advanced Iso-Surfacing Algorithms Jian Huang, CS594, Spring 2002 This set of slides are developed and used by Prof. Han-Wei Shen at Ohio State University.
Visualization Data Representation Ray Gasser SCV Visualization Workshop – Fall 2008.
Geometric Algorithms João Comba. Example: Convex Hull convex Non-convex.
Isocontour/surface Extractions 2D Isocontour 3D Isosurface.
Hank Childs, University of Oregon December 6 th, 2013 Meshes, Fields, and Interpolation, Part 2.
3DSkeleton-based Human Modeling with Metaballs 18 April 2008 Donghun Kim Robot Vision Lab.
Digital Terrain Model (DTM)
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
CDS 301 Fall, 2009 Scalar Visualization Chap. 5 September 24, 2009 Jie Zhang Copyright ©
Spatial Information Systems (SIS)
Data Acquisition, Representation and Reconstruction
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
Advanced Iso- Surfacing Algorithms Mengxia Zhu, Fall 2007.
Scientific Visualization with ParaView Ray Gasser IS&T Scientific Visualization Tutorial – Spring 2010.
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
ENDS 375 Foundations of Visualization Geometric Representation 9/30/04.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Sorting and cell compositing for irregular meshes Nelson Max, Peter Williams, Richard Cook, Claudio Silva.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Marching Cubes A High Resolution 3D Surface Construction Algorithm.
Scientific Data Representation and Mapping
Continuous Scatter Plot Paper by: Sven Bachthaler and Daniel Weiskopf Presented by: Ayan Biswas.
CS-321 Dr. Mark L. Hornick 1 3-D Object Modeling.
lecture 2 : Visualization Basics
Scalar Visualization Chap. 5 September 23, 2008 Jie Zhang Copyright ©
VTK: Data Shroeder et al. Chapter 5 University of Texas – Pan American CSCI 6361, Spring 2014 After Taku Komura and other lecture sets
Scientific Visualization An Introduction Michel O. R. Eboueya Computer Sciences Department Pôle Sciences et Technologies Université de La Rochelle.
19/18/ :34 Graphics II Volume Rendering Session 10.
CS 551/651 Advanced Computer Graphics Warping and Morphing Spring 2002.
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Global Parametrization of Range Image Sets Nico Pietroni, Marco Tarini, Olga Sorkine, Denis Zorin.
3D Volume Visualization. Volume Graphics  Maintains a 3D image representation that is close to the underlying fully-3D object (but discrete)  경계표면 (Boundary.
Computer Graphics: Programming, Problem Solving, and Visual Communication Steve Cunningham California State University Stanislaus and Grinnell College.
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.
By Eugene Adams.  Vertices  Edges  Faces  Polygons  Meshes  2D co-ordinates  3D co-ordinates.
Hank Childs, University of Oregon Unstructured Grids.
Interactive Graphics Lecture 10: Slide 1 Interactive Computer Graphics Lecture 10 Introduction to Surface Construction.
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,
Introduction to Meshes Lecture 22 Mon, Oct 20, 2003.
Space Figures and Nets Section 6-1 Notes and vocabulary available on my home page.
Objective To use angles of elevation and depression to solve problems.
Slide 1Lecture Fall ‘00 Surface Modeling Types: Polygon surfaces Curved surfaces Volumes Generating models: Interactive Procedural.
Digital Elevation Models (DEMs)Constructing Grid DEMConstructing Contour Map Constructing TIN DEM Grid DEM Quality Metric A Digital Elevation Model (DEM)
Ancona - Municipality Hall The principal point PP is the intersection of the three heights of the triangle with vertices the three V.P. The V.P. procedure.
VTK: The Visualization Toolkit
Introduction to the Finite Element Method
CIS 410/510: Isosurfacing (pt 2)
Statistical surfaces: DEM’s
Problems with Vector Overlay Analysis (esp. Polygon)
Domain-Modeling Techniques
CS654: Digital Image Analysis
The Graphics Pipeline Lecture 5 Mon, Sep 3, 2007.
Lecture 3 : Isosurface Extraction
Mesh Parameterization: Theory and Practice
Spatial interpolation
From Voxels to 3D Uri Mike.
Introduction to Meshes
Visualization CSE 694L Roger Crawfis The Ohio State University.
Three Step Geometric Pipeline
Spatial Databases: Digital Terrain Model
Texture mapping - other methods
Spatial Databases: Digital Terrain Model
Introduction to Meshes
1st semester a.y. 2018/2019 – November 22, 2018
Presentation transcript:

Visualization Fundamentals Interpolation Functions Basic 2D Scalar Data Visualization Techniques Color Maps High Fields Contours

Interpolation (1) Visualization deals with discrete data (a) vertex (b) Polyvertex (c) line (d) polyline (e) triangle (e) Quadrilateral (e) Polygon (f) Tetrahedron (f) Hexahedron Values defined only at cell vertices

Interpolation (2) We often need information at positions other than cell vertices p P = ? 10 13 9 12 Interpolation: compute data from known points

Interpolation (3) Three essential information: Cell type Data values at cell vertices Parametric coordinates of the point p D = S Wi * di i=0 n-1 di di: cell point value Wi: weight (S wi = 1) D: interpolated result

Interpolation (4) Parametric Coordinates: Used to specify the location of a point within a cell (a) line r = 0 r = 1 0 <= r <=1 d0 d1 W0 = (1-r) W1 = r D = S Wi * di i=0 n-1 r

Interpolation (5) (b) Triangle s W0 = 1-r-s W1 = r W2 = s p2 r+s = 1 (why?) r=0 Why? r p0 p1 s=0

Interpolation (6) (C) Pixel s s=1 p2 p3 W0 = (1-r)(1-s) W1 = r(1-s) (s,t) r=0 r =1 r p0 s=0 p1 Why? This is also called bi-linear interpolation

Interpolation (7) (D) Polygon p3 p4 Wi = (1/ri) / S(1/ri) r3 p2 p5 Weighted distance function p0 p1

Interpolation (8) (D) Tetrahedron t s p3 W0 = 1-r-s-t p2 W1 = r W2 = s W3 = t p3 p2 p0 r p1

Interpolation (9) (D) Cube (voxel) t W0 = (1-r)(1-s)(1-r) W1 = r(1-s)(1-t) W2 = (1-r)s(1-t) W3 = rs(1-r) W4 = (1-r)(1-s)t W5 = r(1-s)t W6 = (1-r)st W7 = rst p6 p7 p4 p5 s p2 p3 r p0 p1

Interpolation (10) The interpolation function can be used to calculate the geometric position as well. That is, given (r,s,t), calculate the global coordinates Local to global coordinate transformation: P = S Wi * Pi n-1 i=0

Interpolation (11) How to get (r,s,t) ? Line, Pixel, Cube are all trivial Triangle, Tetrahedron can be solved analytically Qudrilateral or Hexahedra need numerical method P = S Wi * Pi n-1 Known: P, Pi Unkown: Wi (i.e. r,s,t) i=0

Color Mapping R G B v1 v2 v3 ... Values at vertices Color lookup Result table

High Fields Used to visualize digital elevation maps Triangulate Lift the height of each point Connect the points as triangles

Contours 3 7 10 4 C = 6