Hank Childs, University of Oregon November 6 th, 2013 Spatial-Based and Variable-Based Selections.

Slides:



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

Visualization Data Representation Ray Gasser SCV Visualization Workshop – Fall 2008.
ParaView Tutorial Greg Johnson, Karla Vega. Before we begin… Make sure you have ParaView installed so you can follow along in the lab section –
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.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
University of British Columbia CPSC 314 Computer Graphics Jan-Apr 2005 Tamara Munzner Information Visualization.
lecture 4 : Isosurface Extraction
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.
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Chapter 15 – Multiple Integrals 15.7 Triple Integrals 1 Objectives:  Understand how to calculate triple integrals  Understand and apply the use of triple.
ITUppsala universitet Data representation and fundamental algorithms Filip Malmberg
Continuous Scatter Plot Paper by: Sven Bachthaler and Daniel Weiskopf Presented by: Ayan Biswas.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Louisiana Tech University Ruston, LA Slide 1 Krogh Cylinder Steven A. Jones BIEN 501 Wednesday, May 7, 2008.
Martin-Gay, Developmental Mathematics 1 AAT-A Date: 12/10/13 SWBAT add and multiply radicals Do Now: Rogawski #77a get the page 224 Complete HW Requests:Adding.
Skills for October Rounds
COMP 175: Computer Graphics March 24, 2015
Chapter 13 Multiple Integrals by Zhian Liang.
Volumetric Visualization. Outline Announcements –PS III due Friday –Last day for self-motivated assignment Belated CookiePresentation What is VV? Slices.
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
19/18/ :34 Graphics II Volume Rendering Session 10.
Vector Analysis Copyright © Cengage Learning. All rights reserved.
Chapter 1: Getting Started with MATLAB MATLAB for Scientist and Engineers Using Symbolic Toolbox.
Hank Childs, University of Oregon Lecture #6 CIS 410/510: Advection (Part 1)
Hank Childs, University of Oregon Lecture #4 Fields, Meshes, and Interpolation (Part 3)
Hank Childs, University of Oregon Lecture #3 Fields, Meshes, and Interpolation (Part 2)
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.
Multiple Integration Copyright © Cengage Learning. All rights reserved.
Hank Childs, University of Oregon Lecture #10 CIS 410/510: Isosurfacing.
Hank Childs, University of Oregon Lecture #9 CIS 410/510: Advection (Part 4!)
Hank Childs, University of Oregon Isosurfacing (Part 3)
Hank Childs, University of Oregon Unstructured Grids.
Hank Childs, University of Oregon Volume Rendering, Part 3.
Hank Childs, University of Oregon Volume Rendering Primer / Intro to VisIt.
Visualization with ParaView. Before we begin… Make sure you have ParaView 3.14 installed so you can follow along in the lab section –
Hank Childs, University of Oregon Volume Rendering, pt 1.
What is a 3-D Shape? This is a cube height depth length It has 3 dimensions – length, height and depth. All 3-D shapes are solids.
Section 16.3 Triple Integrals. A continuous function of 3 variables can be integrated over a solid region, W, in 3-space just as a function of two variables.
Hank Childs, University of Oregon Overview of VTK (Pt 2)
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2015.
CSE554Contouring IISlide 1 CSE 554 Lecture 3: Contouring II Fall 2011.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
Hank Childs, University of Oregon Jan. 21st, 2013 CIS 610: Many-core visualization libraries.
Hank Childs, University of Oregon Overview of VTK (Pt 3)
Cube A cube[1] is a three-dimensional solid object bounded by six square faces, facets or sides, with three meeting at each vertex[1]three-dimensionalsquarefacetsvertex.
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 ©
Implementing Finite Volume Methods 1.  Continue on Finite Volume Methods for Elliptic Equations  Finite Volumes in Two-Dimensions  Poisson’s Equation.
Use the Divergence Theorem to calculate the surface integral {image} {image} S is the surface of the box bounded by the planes x = 0, x = 4, y = 0, y =
5. I can recognize right triangles in real world applications. 1. I can identify the hypotenuse of any right triangle. Who am I? 2. I can prove.
CIS 410/510: Isosurfacing (pt 2)
Hank Childs, University of Oregon
1 Divergence Theorem. 2 Understand and use the Divergence Theorem. Use the Divergence Theorem to calculate flux. Objectives Total flux change = (field.
Hank Childs, University of Oregon
Triple Integrals.
Use the Divergence Theorem to calculate the surface integral {image} {image} S is the surface of the box bounded by the planes x = 0, x = 2, y = 0, y =
Hank Childs, University of Oregon
You need: Pencil Agenda Scrap Paper AP log Math book Calculator
Hank Childs, University of Oregon
Evaluate the iterated integral. {image} Select the correct answer
Copyright © Cengage Learning. All rights reserved.
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
You need: Pencil Agenda Scrap Paper AP log Math book Calculator
Visualization CSE 694L Roger Crawfis The Ohio State University.
CIS 441/541: Introduction to Computer Graphics Lecture 15: shaders
Presentation transcript:

Hank Childs, University of Oregon November 6 th, 2013 Spatial-Based and Variable-Based Selections

Announcements Final project – Come in & talk with me OH: – Weds 10-11:30 – Thurs Who wants to take 610 class?

Project #7A You write a VTK program. – I expect that your answers will be partially derived from previous VTK programs – Python OK 4 renderers in 1 window isosurface three slices hedgehogs streamlines Please note that this is the longest time I have allocated for an assignment all quarter

Project #7B You will read a data file and put it into VTK You will compare two VTK data sets and see where they differ You will write code to thin hedgehog plots – (7A prompt will be changed)

Slicing Assume rectilinear mesh with – X={0,1,2,3,4,5,6,7,8,9} – Y={0,1,2,3,4,5,6,7,8,9} – Z={0,1,2,3,4,5,6,7,8,9} How do we generate slice at Y=5?

Slice at Y=5 Output mesh: – X={0,1,2,3,4,5,6,7,8,9} – Y={5} – Z={0,1,2,3,4,5,6,7,8,9} for (int z = 0 ; z < 10 ; z++) for (int x = 0 ; x < 10 ; x++) outF[z*10+x] = F[z*100+5*10+x];

Slicing Assume rectilinear mesh with – X={0,1,2,3,4,5,6,7,8,9} – Y={0,1,2,3,4,5,6,7,8,9} – Z={0,1,2,3,4,5,6,7,8,9} How do we generate slice at Y=5.3?

Slice at Y=5.3 Output mesh: – X={0,1,2,3,4,5,6,7,8,9} – Y={5.3} – Z={0,1,2,3,4,5,6,7,8,9} for (int z = 0 ; z < 10 ; z++) for (int x = 0 ; x < 10 ; x++) outF[z*10+x] = (0.3)*(F[z*100+6*10+x]-F[z*100+5*10+x]) + F[z*100+5*10+x];

Slicing Assume rectilinear mesh with – X={0,1,2,3,4,5,6,7,8,9} – Y={0,1,2,3,4,5,6,7,8,9} – Z={0,1,2,3,4,5,6,7,8,9} How do we generate slice at plane X+Y+Z=0? Answer: we will need “distance functions”

Distance Functions Distance function: measures how far a point is from surface Example: how far are you from the plane X+Y+Z=0? How far is the point (3,0,0) from this plane? Answer: 3 units

(0,0) (1,1) Distance Functions Distance function: measures how far a point is from surface Example: how far are you from the plane X+Y+Z=0? How far is the point (1,1,0) from this plane? 2 units Cross-section at Z=0 Answer: sqrt(2) units

How to use distance functions to slice? Step #1: create distance function Step #2: isosurface with isovalue = 0

Revisiting Y=5.3 Some cells straddle Y=5.3 When classifying, all Y=5 get 0, all Y=6 get Y

Distance Functions: approximate version Distance function: measures how far a point is from surface Example: how far are you from the plane X+Y+Z=0? How far is the point (x,y,z) from this plane? Approx. answer: x+y+z units Why? Approximate answer: the overestimates (on both sides) cancel each other out.

Analogy UCD Math 127A: Introduction to Mathematical Analysis 10 week course First 8 weeks: – Intermediate Value Theorem Last two weeks: – All of derivatives and integrals

Threshold Keep cell if it meets some criteria, else discard Criteria: – Pressure > 2 – 10 < temperature < 20 Cells that meet criteria

How to implement threshold Iterate over cells If a cell meets the criteria, then place that cell in the output Output is an unstructured mesh

Interval Volumes Isolates portion of volume between two values, V_low and V_hi.

Interval volumes vs isosurfaces Interval volume between 2.5 and 2.7. Isosurfaces at 2.5 and 2.7.

How to implement interval volumes Iterate over cells Like marching cubes, but making topologically 3D output (tetrahedrons, not triangles) Now 3 states: below, within interval, above Many, many cases to determine

Box Isolate portion of volume within a box -8 < x < 8 -9 < y < < z < 6.4

How to implement box Iterate over cells Three cases: – Retain cell – Discard cell – Split cell (i.e., straddles box boundary) How to split cell? – Box:Interval Volume as Slicing:Isosurfacing (set up 6 distance fields and use interval volumes) (why not 1 distance field?)

Clip Clip by arbitrary functions

How to implement Clip Same as Box, but different spatial function Iterate over cells Three cases: – Retain cell – Discard cell – Split cell (i.e., straddles clip boundary) How to split cell? – Clip:Interval Volume as Slicing:Isosurfacing (possibly multiple clips)

Slicing by non-planes

How to non-planar slicing Set up distance function for spatial function (cone, sphere) Apply Marching Cubes

Isosurface by one variable, color by another Isosurface by var1, color by var1 Isosurface by var1, color by var2

How to implement isosurface by var1, color by var2 Marching Cubes based on var1. Need operation: – As Marching Cubes calculates each triangle, evaluate var2 for each vertex of that triangle – Create variable var2 on output triangle mesh