Data Visualization Fall 2015. The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization,

Slides:



Advertisements
Similar presentations
COMP 175 | COMPUTER GRAPHICS Remco Chang1/6103b – Shapes Lecture 03b: Shapes COMP 175: Computer Graphics February 3, 2015.
Advertisements

Yang Yang, Miao Jin, Hongyi Wu Presenter: Buri Ban The Center for Advanced Computer Studies (CACS) University of Louisiana at Lafayette 3D Surface Localization.
2D/3D Shape Manipulation, 3D Printing
Image Segmentation Image segmentation (segmentace obrazu) –division or separation of the image into segments (connected regions) of similar properties.
Xianfeng Gu, Yaling Wang, Tony Chan, Paul Thompson, Shing-Tung Yau
Dual Marching Cubes: An Overview
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
CDS 301 Fall, 2009 Scalar Visualization Chap. 5 September 24, 2009 Jie Zhang Copyright ©
Instructor: Mircea Nicolescu Lecture 13 CS 485 / 685 Computer Vision.
1 Processing & Analysis of Geometric Shapes Shortest path problems Shortest path problems The discrete way © Alexander & Michael Bronstein, ©
Isoparametric Elements
Asst. Prof. Yusuf Sahillioğlu
Computer Graphics - Class 14
Computational Geometry The art of finding algorithms for solving geometrical problems Literature: –M. De Berg et al: Computational Geometry, Springer,
Introduction to Volume Visualization Mengxia Zhu Fall 2007.
Scientific Visualization Data Modelling for Scientific Visualization CS 5630 / 6630 August 28, 2007.
Non-Euclidean Embedding
ENDS 375 Foundations of Visualization Geometric Representation 10/5/04.
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
GI Systems and Science January 23, Points to Cover  What is spatial data modeling?  Entity definition  Topology  Spatial data models Raster.
Scientific Data Representation and Mapping
lecture 2, linear imaging systems Linear Imaging Systems Example: The Pinhole camera Outline  General goals, definitions  Linear Imaging Systems.
1 Finite-Volume Formulation. 2 Review of the Integral Equation The integral equation for the conservation statement is: Equation applies for a control.
CSE 681 Ray Tracing Implicit Surfaces. CSE 681 Overview Similar to CSG –Combine primitive objects to form complex object Primitives are “density fields”
CS 485/685 Computer Vision Face Recognition Using Principal Components Analysis (PCA) M. Turk, A. Pentland, "Eigenfaces for Recognition", Journal of Cognitive.
Slope and Aspect Calculated from a grid of elevations (a digital elevation model) Slope and aspect are calculated at each point in the grid, by comparing.
Spatial data models (types)
Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.
CIS V/EE894R/ME894V A Case Study in Computational Science & Engineering HW 5 Repeat the HW associated with the FD LBI except that you will now use.
C O M P U T E R G R A P H I C S Stuff Jian Chen January 15, 2010 Transformations 1/10 Describing Shape By Andries van Dam.
VTK: Data Shroeder et al. Chapter 5 University of Texas – Pan American CSCI 6361, Spring 2014 After Taku Komura and other lecture sets
CDS 301 Fall, 2009 Data Representation Chap. 3 September 10, 2009 Jie Zhang Copyright ©
V. Space Curves Types of curves Explicit Implicit Parametric.
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Lecture 3 : Direct Volume Rendering Bong-Soo Sohn School of Computer Science and Engineering Chung-Ang University Acknowledgement : Han-Wei Shen Lecture.
8. Geographic Data Modeling. Outline Definitions Data models / modeling GIS data models – Topology.
2D/3D Shape Manipulation, 3D Printing Shape Representations Slides from Olga Sorkine February 20, 2013 CS 6501.
CS 638, Fall 2001 Today Project Stage 0.5 Environment mapping Light Mapping.
A fast and precise peak finder V. Buzuloiu (University POLITEHNICA Bucuresti) Research Seminar, Fermi Lab November 2005.
Simplifying Surfaces with Color and Texture using Quadric Error Metrics Michael Garland Paul S. Heckbert Carnegie Mellon University October 1998 Michael.
Parametric Surfaces Define points on the surface in terms of two parameters Simplest case: bilinear interpolation s t s x(s,t)x(s,t) P 0,0 P 1,0 P 1,1.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
Reconstruction of Solid Models from Oriented Point Sets Misha Kazhdan Johns Hopkins University.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
112/5/ :54 Graphics II Image Based Rendering Session 11.
Artistic Surface Rendering Using Layout Of Text Tatiana Surazhsky Gershon Elber Technion, Israel Institute of Technology.
CS 325 Introduction to Computer Graphics 03 / 29 / 2010 Instructor: Michael Eckmann.
Review on Graphics Basics. Outline Polygon rendering pipeline Affine transformations Projective transformations Lighting and shading From vertices to.
Representation and modelling 3 – landscape specialisations 4.1 Introduction 4.2 Simple height field landscapes 4.3 Procedural modeling of landscapes- fractals.
Data Visualization Fall Information Visualization Fall 2015Data Visualization2 Upon now, we dealt with scientific visualization (scivis) Scivis.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Splines Sang Il Park Sejong University. Particle Motion A curve in 3-dimensional space World coordinates.
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.
CDS 301 Fall, 2008 Data Representation Chap. 3 September 2, 2008 Jie Zhang Copyright ©
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Wavelets Chapter 7 Serkan ERGUN. 1.Introduction Wavelets are mathematical tools for hierarchically decomposing functions. Regardless of whether the function.
1 C.A.L. Bailer-Jones. Machine Learning. Data exploration and dimensionality reduction Machine learning, pattern recognition and statistical data modelling.
Unit-4 Geometric Objects and Transformations- I

VTK: The Visualization Toolkit
Intrinsic Data Geometry from a Training Set
T. Chernyakova, A. Aberdam, E. Bar-Ilan, Y. C. Eldar
Constructing Objects in Computer Graphics By Andries van Dam©
Fitting Curve Models to Edges
Domain-Modeling Techniques
Information Visualization
Unstructured grid: an introduction
Presentation transcript:

Data Visualization Fall 2015

The Data as a Quantity Quantities can be classified in two categories: Intrinsically continuous (scientific visualization, or scivis) e.g. pressure, temperature, position, speed, density, force, color, light intensity etc. Intrinsically discrete (information visualization, or infovis) e.g. text, hypertext, content of web pages, database records etc. Sampled data – originally continuous data represented in a finite approximative form Corollary of the difference between sampled and discrete data: In the case of sampled data, we can go back to a continuous approximation of the original (intrinsically) continuous data Fall 2015Data Visualization2

Datasets and Dimensions Fall 2015Data Visualization3 Let the triplet D = (D, C, f) define a continuous dataset We assume that f : D → C D refers to a function domain, C is the function codomain d is the geometrical dimension of the space R d into which D is embedded s <= d represents the topological dimension of D itself (e.g. plane in the Euclidean space R 3 has s = 2 s is number of independent variables required to represent the domain D) Codimension of an object of some d and s is the difference d – s

Datasets and Dimensions Fall 2015Data Visualization4 Virtually all data-visualization apps fix geometrical dimension d = 3 Only the topological dimension varies s = {1, 2, 3} s = 1 corresponds to the curve s = 2 corresponds to the surface s = 3 corresponds to the volumetric datasets Topological dimension and dataset dimension are used interchangeably Topological dimension is important in case of sampled datasets and grid cells

Datasets and Dimensions Fall 2015Data Visualization5 Function values are called dataset attributes The dimensionality c of the function codomain C is also called the attribute dimension Typically ranges from 1 to 4

Sampled Data Fall 2015Data Visualization6 Typically, continuous functional representation of data is not available Moreover, several operations (filtering, simplification, analysis etc.) on such data are not efficient Visualization apps work with sampled datasets Important operations relating continuous and sampled data: Sampling – quite straightforward Reconstruction – more complicated, the goal is to recover an approximated version of the original continuous data

Sampled Data Fall 2015Data Visualization7 Reconstruction employs interpolation of the values of the function between its sample points Sampling strategies: uniform, non-uniform Sampled dataset should be accurate (up to an user-specified error), minimal (resp. to an error), generic (operations), efficient (algorithmically), and simple (implementation) [Schroeder et al. 2006]

Sampled Data Fall 2015Data Visualization8 Sampled dataset consists of a set of N sample points and values Interpolation - the reconstructed function should equal the original one at all sample points, i.e. One way to define reconstruction function: Subsequently, we get Orthogonality basis function Normality of basis function Basis/interpolation functions

Grid Fall 2015Data Visualization9 A grid (aka mesh) is a subdivision of a domain D into a collection of cells (aka elements) Most commonly used cells: polylines in R Polygons in R 2 Polyhedra in R 3 Union of cells cover entire domain D and cells are non-overlapping, and vertices are sample points

Grid Fall 2015Data Visualization10 Simplest set of basis function: Sample points are inside the grid cells Nearest-neighbor interpolation Virtually no computation cost Work with any cell shape and in any dimension Provide a poor, staircase-like approximation We can provide a better (i.e. more continuous) reconstruction of the original function constant, zero-order continuity

Grid Fall 2015Data Visualization11 Linear basis function – next simplest basis functions Need to make some assumption about the cell types used in the grid Assume quadrilateral cells having 4 vertices Reference cell in R 2 : v 1 =(0,0), v 2 =(1,0), v 3 =(1,1), v 4 =(0,1) reference coordinates

Grid Fall 2015Data Visualization12 Given any cell type having n vertices p i in R 3, we define transformation T that maps from a point r,s in reference cell coordinate system to a point x,y,z in the actual cell as follows T maps the reference cell to the world cell T -1 maps points x, y, z in the world cell to points r, s in the reference cell

Grid Fall 2015Data Visualization13 Having T -1, we can rewrite the reconstruction function for quad cell as To compute T -1, we have to invert the expression But, this depends on the actual cell type and will be treated later on Now, we have a way to reconstruct a piecewise C 1 function from samples on any quad grid

Grid Fall 2015Data Visualization14 Source: Data Visualization: Principles and Practice

Grid Fall 2015Data Visualization15 Source: Data Visualization: Principles and Practice

Grid Fall 2015Data Visualization16 Source: Data Visualization: Principles and Practice

Grid Fall 2015Data Visualization17 Source: Data Visualization: Principles and Practice