Hank Childs, University of Oregon Lecture #3 Fields, Meshes, and Interpolation (Part 2)

Slides:



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

Coordinatate systems are used to assign numeric values to locations with respect to a particular frame of reference commonly referred to as the origin.
CS412/413 Introduction to Compilers Radu Rugina Lecture 37: DU Chains and SSA Form 29 Apr 02.
Efficient access to TIN Regular square grid TIN Efficient access to TIN Let q := (x, y) be a point. We want to estimate an elevation at a point q: 1. should.
Hank Childs, University of Oregon November 6 th, 2013 Spatial-Based and Variable-Based Selections.
CAP4730: Computational Structures in Computer Graphics Visible Surface Determination.
Hank Childs, University of Oregon November 15 th, 2013 Volume Rendering, Part 2.
Hank Childs, University of Oregon December 6 th, 2013 Meshes, Fields, and Interpolation, Part 2.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.
CS 410 Applied Algorithms Applied Algorithms Lecture #3 Data Structures.
1 Algorithms for Large Data Sets Ziv Bar-Yossef Lecture 8 May 4, 2005
CSE351/ IT351 Modeling And Simulation Choosing a Mesh Model Dr. Jim Holten.
CSE351/ IT351 Modeling and Simulation
Spatial and Temporal Data Mining
The Goldreich-Levin Theorem: List-decoding the Hadamard code
Scientific Visualization Data Modelling for Scientific Visualization CS 5630 / 6630 August 28, 2007.
1 CS 201 Passing Function as Parameter & Array Debzani Deb.
Lec 5 Feb 10 Goals: analysis of algorithms (continued) O notation summation formulas maximum subsequence sum problem (Chapter 2) three algorithms image.
CS 376b Introduction to Computer Vision 04 / 15 / 2008 Instructor: Michael Eckmann.
September 23, 2010Neural Networks Lecture 6: Perceptron Learning 1 Refresher: Perceptron Training Algorithm Algorithm Perceptron; Start with a randomly.
Fluid Surface Rendering in CUDA Andrei Monteiro Marcelo Gattass Assignment 4 June 2010.
CSC 2300 Data Structures & Algorithms March 30, 2007 Chapter 9. Graph Algorithms.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
2IV60 Computer Graphics Basic Math for CG
October 8, 2013Computer Vision Lecture 11: The Hough Transform 1 Fitting Curve Models to Edges Most contours can be well described by combining several.
Shading (introduction to rendering). Rendering  We know how to specify the geometry but how is the color calculated.
lecture 2 : Visualization Basics
Course Organization & Format Visualization II MSIM 842, CS 795/895 Instructor: Jessica Crouch.
Hank Childs, University of Oregon October 3, 2014 CIS 441/541: Intro to Computer Graphics Lecture 2: The Scanline Algorithm.
C++ Programming Language Lecture 2 Problem Analysis and Solution Representation By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department.
Model Task 0A: Programming the 1D upstream scheme ATM 562 Fall 2015 Fovell 1.
Hank Childs, University of Oregon Oct. 10, 2014 CIS 441/541: Introduction to Computer Graphics Lecture 4: Interpolating Colors and the Z-buffer.
Hank Childs, University of Oregon Lecture #6 CIS 410/510: Advection (Part 1)
Physics Honors Lecture A & B Days 08/31/15 & 09/1/15 Motion in 1D.
Hank Childs, University of Oregon Lecture #4 Fields, Meshes, and Interpolation (Part 3)
1 CS 177 Week 12 Recitation Slides Running Time and Performance.
Hank Childs, University of Oregon Lecture #10 CIS 410/510: Isosurfacing.
Hank Childs, University of Oregon Lecture #2 Fields, Meshes, and Interpolation (Part 1)
Hank Childs, University of Oregon Lecture #9 CIS 410/510: Advection (Part 4!)
Hank Childs, University of Oregon Isosurfacing (Part 3)
1 COMS 261 Computer Science I Title: C++ Fundamentals Date: September 9, 2005 Lecture Number: 6.
Hank Childs, University of Oregon Unstructured Grids.
Hank Childs, University of Oregon Volume Rendering, Part 3.
Project18’s Communication Drawing Design By: Camilo A. Silva BIOinformatics Summer 2008.
Hank Childs, University of Oregon Volume Rendering, pt 1.
CSC 212 Sequences & Iterators. Announcements Midterm in one week  Will cover through chapter 5 of book  Midterm will be open book, open note (but, closed.
CS 173, Lecture B Tandy Warnow. Topics for today Reminder about Examlet on Tuesday My office hours next week: –Tuesday 2-3 PM and Thursday 3-4 PM Office.
Advanced Visualization Overview. Course Structure Syllabus Reading / Discussions Tests Minor Projects Major Projects For.
Boris Milašinović Faculty of Electrical Engineering and Computing University of Zagreb, Croatia.
The Hashemite University Computer Engineering Department
Image Processing A Study in Pixel Averaging Building a Resolution Pyramid With Parallel Computing Denise Runnels and Farnaz Zand.
Hank Childs, University of Oregon Overview of VTK (Pt 3)
Refined Online Citation Matching and Adaptive Canonical Metadata Construction CSE 598B Course Project Report Huajing Li.
Adiabatic Quantum Computing Josh Ball with advisor Professor Harsh Mathur Problems which are classically difficult to solve may be solved much more quickly.
Coordinatate systems are used to assign numeric values to locations with respect to a particular frame of reference commonly referred to as the origin.
MOTION Motion: Change in position over time and is described by speed, velocity and acceleration.
Section 8 Numerical Analysis CSCI E-24 José Luis Ramírez Herrán October 20, 2015.
Hank Childs, University of Oregon
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
CIS 410/510: Isosurfacing (pt 2)
Hank Childs, University of Oregon
Hank Childs, University of Oregon
3.1 Clustering Finding a good clustering of the points is a fundamental issue in computing a representative simplicial complex. Mapper does not place any.
Scalars Some quantities, like temperature, distance, height, area, and volume, can be represented by a ________________ that indicates __________________,
Hank Childs, University of Oregon
Hank Childs, University of Oregon
2D Arrays October 12, 2007 ComS 207: Programming I (in Java)
Searching, Sorting, and Asymptotic Complexity
Hank Childs, University of Oregon
Presentation transcript:

Hank Childs, University of Oregon Lecture #3 Fields, Meshes, and Interpolation (Part 2)

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Project #1 Goal: write a specific image Due: “today” % of grade: 2% How is project #1 going?

Office Hours & Piazza OH: Doodle Piazza: set up & sent

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

SciVis vs InfoVis “it’s infovis when the spatial representation is chosen, and it’s scivis when the spatial representation is given” (A) (B) (E) (C) (D)

Elements of a Visualization Legend Provenance Information Reference CuesDisplay of Data

Elements of a Visualization What is the value at this location? How do you know? What data went into making this picture?

Where does temperature data come from? Iowa circa 1980s: people phoned in updates 6:00pm: Grandma calls in 80F. 6:00pm: Grandma’s friend calls in 82F. What is the temperature along the white line?

What is the temperature at points between Ralston and Glidden? D=0, Ralston, IA Distance D=10 miles, Glidden, IA ~ ~ Temperature 80F 82F 81F

Ways Visualization Can Lie Data Errors: Data collection is inaccurate Data collected too sparsely Visualization Program Visualization Errors: Illusion of certainty Poor choices of parameters

Scalar Fields Defined: associate a scalar with every point in space. What is a scalar? – A: a real number Examples: – Temperature – Density – Pressure The temperature at ° N, ° W is 66F. Fields are defined at every location in a space (example space: USA)

Vector Fields Defined: associate a vector with every point in space. What is a vector? – A: a direction and a magnitude Examples: – Velocity The velocity at location (5, 6) is (-0.1, -1) The velocity at location (10, 5) is (-0.2, 1.5) Typically, 2D spaces have 2 components in their vector field, and 3D spaces have 3 components in their vector field.

More fields (discussed later in course) Tensor fields Functions Volume fractions Multi-variate data

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Mesh What we want

An example mesh

Where is the data on this mesh? (for today, it is at the vertices of the triangles)

An example mesh Why do you think the triangles change size?

Anatomy of a computational mesh Meshes contain: – Cells – Points This mesh contains 3 cells and 13 vertices Pseudonyms: Cell == Element == Zone Point == Vertex == Node

Types of Meshes Curvilinear Adaptive Mesh Refinement Unstructured We will discuss all of these mesh types more later in the course.

Rectilinear meshes Rectilinear meshes are easy and compact to specify: – Locations of X positions – Locations of Y positions – 3D: locations of Z positions Then: mesh vertices are at the cross product. Example: – X={0,1,2,3} – Y={2,3,5,6} Y=6 Y=5 Y=3 Y=2 X=1X=0X=2X=3

Rectilinear meshes aren’t just the easiest to deal with … they are also very common

Quiz Time A 3D rectilinear mesh has: – X = {1, 3, 5, 7, 9} – Y = {2, 3, 5, 7, 11, 13, 17} – Z = {1, 2, 3, 5, 8, 13, 21, 34, 55} How many points? How many cells? = 5*7*9 = 315 = 4*6*8 = 192 Y=6 Y=5 Y=3 Y=2 X=1X=0X=2X=3

Definition: dimensions A 3D rectilinear mesh has: – X = {1, 3, 5, 7, 9} – Y = {2, 3, 5, 7, 11, 13, 17} – Z = {1, 2, 3, 5, 8, 13, 21, 34, 55} Then its dimensions are 5x7x9

How to Index Points Motivation: many algorithms need to iterate over points. for (int i = 0 ; i < numPoints ; i++) { double *pt = GetPoint(i); AnalyzePoint(pt); }

Schemes for indexing points Logical point indices Point indices What would these indices be good for?

How to Index Points Problem description: define a bijective function, F, between two sets: – Set 1: {(i,j,k): 0<=i<nX, 0<=j<nY, 0<=k<nZ} – Set 2: {0, 1, …, nPoints-1} Set 1 is called “logical indices” Set 2 is called “point indices” Note: for the rest of this presentation, we will focus on 2D rectilinear meshes.

How to Index Points Many possible conventions for indexing points and cells. Most common variants: – X-axis varies most quickly – X-axis varies most slowly F

Bijective function for rectilinear meshes for this course int GetPoint(int i, int j, int nX, int nY) { return j*nX + i; } F

Bijective function for rectilinear meshes for this course int *GetLogicalPointIndex(int point, int nX, int nY) { int rv[2]; rv[0] = point % nX; rv[1] = (point/nX); return rv; // terrible code!! }

int *GetLogicalPointIndex(int point, int nX, int nY) { int rv[2]; rv[0] = point % nX; rv[1] = (point/nX); return rv; } F

Quiz Time #2 A mesh has dimensions 6x8. What is the point index for (3,7)? What are the logical indices for point 37? int GetPoint(int i, int j, int nX, int nY) { return j*nX + i; } int *GetLogicalPointIndex(int point, int nX, int nY) { int rv[2]; rv[0] = point % nX; rv[1] = (point/nX); return rv; // terrible code!! } = 45 = (1,6)

Quiz Time #3 A vector field is defined on a mesh with dimensions 100x100 The vector field is defined with double precision data. How many bytes to store this data? = 100x100x2x8 = 160,000

Bijective function for rectilinear meshes for this course int GetCell(int i, int j int nX, int nY) { return j*(nX-1) + i; }

Bijective function for rectilinear meshes for this course int *GetLogicalCellIndex(int cell, int nX, int nY) { int rv[2]; rv[0] = cell % (nX-1); rv[1] = (cell/(nX-1)); return rv; // terrible code!! }

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Linear Interpolation for Scalar Field F Goal: have data at some points & want to interpolate data to any location

Linear Interpolation for Scalar Field F A B F(B) F(A) X F(X)

Linear Interpolation for Scalar Field F General equation to interpolate: – F(X) = F(A) + t*(F(B)-F(A)) t is proportion of X between A and B – t = (X-A)/(B-A) A B F(B) X F(X) F(A)

Quiz Time #4 General equation to interpolate: – F(X) = F(A) + t*(F(B)-F(A)) t is proportion of X between A and B – t = (X-A)/(B-A) F(3) = 5, F(6) = 11 What is F(4)? = 5 + (4-3)/(6-3)*(11-5) = 7

Bilinear interpolation for Scalar Field F F(0,0) = 10 F(1,0) = 5 F(1,1) = 6 F(0,1) = 1 What is value of F(0.3, 0.4)? F(0.3, 0) = 8.5 F(0.3, 1) = 2.5 = 6.1 General equation to interpolate: F(X) = F(A) + t*(F(B)-F(A)) Idea: we know how to interpolate along lines. Let’s keep doing that and work our way to the middle.

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Cell location Problem definition: you have a physical location (P). You want to identify which cell contains P. Solution: multiple approaches that incorporate spatial data structures. – Best data structure depends on nature of input data. More on this later in the quarter.

Cell location for project 2 Traverse X and Y arrays and find the logical cell index. – X={0, 0.05, 0.1, 0.15, 0.2, 0.25} – Y={0, 0.05, 0.1, 0.15, 0.2, 0.25} (Quiz) what cell contains (0.17,0.08)? = (3,1)

Facts about cell (3,1) It’s cell index is 8. It contains points (3,1), (4,1), (3,2), and (4,2). Facts about point (3,1): – It’s location is (X[3], Y[1]) – It’s point index is 9. – It’s scalar value is F(9). Similar facts for other points.  we have enough info to do bilinear interpolation

Outline Projects & OH Review The Data We Will Study (pt 2) – Meshes – Interpolation Cell Location Project 2

Project 2: Field evaluation Goal: for point P, find F(P) Strategy in a nut shell: – Find cell C that contains P – Find C’s 4 vertices, V0, V1, V2, and V3 – Find F(V0), F(V1), F(V2), and F(V3) – Find locations of V0, V1, V2, and V3 – Perform bilinear interpolation to location P

Project 2 Assigned today, prompt online Due October 10 th, midnight (  October 11 th, 6am) Worth 7% of your grade I provide: – Code skeleton online – Correct answers provided You send me: – source code – output from running your program

What’s in the code skeleton Implementations for: – GetNumberOfPoints – GetNumberOfCells – GetPointIndex – GetCellIndex – GetLogicalPointIndex – GetLogicalCellIndex – “main”: set up mesh, call functions, create output Our bijective function }

What’s not in the code skeleton … and a few other functions you need to implement

Cell-centered data

Rayleigh Taylor Instability