Critical points and flow structure for density data Joint work with H. Edelsbrunner, J. Harer, and V. Pascucci Vijay Natarajan Duke University.

Slides:



Advertisements
Similar presentations
Sauber et al.: Multifield-Graphs Multifield-Graphs: An Approach to Visualizing Correlations in Multifield Scalar Data Natascha Sauber, Holger Theisel,
Advertisements

Johann Radon Institute for Computational and Applied Mathematics: 1/35 Signal- und Bildverarbeitung, Image Analysis and Processing.
Discrete Differential Geometry Planar Curves 2D/3D Shape Manipulation, 3D Printing March 13, 2013 Slides from Olga Sorkine, Eitan Grinspun.
Texture Synthesis on [Arbitrary Manifold] Surfaces Presented by: Sam Z. Glassenberg* * Several slides borrowed from Wei/Levoy presentation.
Bio-CAD M. Ramanathan Bio-CAD. Molecular surfaces Bio-CAD.
Computational Topology for Computer Graphics Klein bottle.
Topology-Based Analysis of Time-Varying Data Scalar data is often used in scientific data to represent the distribution of a particular value of interest,
Topological Data Analysis
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.
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Contour Tree and Small Seed Sets for Isosurface Traversal Marc van Kreveld Rene van Oostrum Chandrajit Bajaj Valerio Pascucci Daniel R. Schikore.
Computational Geometry -- Voronoi Diagram
I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, Ke Yi Duke University University of Aarhus.
lecture 4 : Isosurface Extraction
Chapter 9 Graph algorithms. Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
CSE351/ IT351 Modeling and Simulation
Data Analysis and Visualization Using the Morse-Smale complex
Chapter 7 Network Flow Models.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Towards Topology-Rich Visualization Attila Gyulassy SCI Institute, University of Utah.
I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, and Ke Yi Duke University University of Aarhus.
Accelerating Marching Cubes with Graphics Hardware Gunnar Johansson, Linköping University Hamish Carr, University College Dublin.
Graphs G = (V,E) V is the vertex set. Vertices are also called nodes and points. E is the edge set. Each edge connects two different vertices. Edges are.
Fast Isocontouring For Improved Interactivity Chandrajit L. Bajaj Valerio Pascucci Daniel R. Schikore.
Scientific Visualization Data and Geometry Processing for Scientific Visualization CS 5630 / 6630 August 28, 2007.
Contributed Talk at the International Workshop on VISUALIZATION and MATHEMATICS 2002 Thomas Lewiner, Hélio Lopes, Geovan Tavares Math&Media Laboratory,
Pascucci-1 Utah April 2008 Understanding the Dynamics of Rayleigh-Taylor instabilities Rayleigh-Taylor instabilities arise in fusion, super-novae, and.
CSE 681 Ray Tracing Implicit Surfaces. CSE 681 Overview Similar to CSG –Combine primitive objects to form complex object Primitives are “density fields”
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Lecture 4 : Isosurface Extraction (Advanced Topics)
Multi-Scale Dual Morse Complexes for Representing Terrain Morphology E. Danovaro Free University of Bolzano, Italy L. De Floriani University of Genova,
1 Surface Applications Fitting Manifold Surfaces To 3D Point Clouds, Cindy Grimm, David Laidlaw and Joseph Crisco. Journal of Biomechanical Engineering,
Marching Cubes: A High Resolution 3D Surface Construction Algorithm William E. Lorenson Harvey E. Cline General Electric Company Corporate Research and.
Extracting Terrain Morphology A New Algorithm and a Comparative Evaluation Paola Magillo, Emanuele Danovaro, Leila De Floriani, Laura Papaleo, Maria Vitali.
I/O-Efficient Batched Union-Find and Its Applications to Terrain Analysis Pankaj K. Agarwal, Lars Arge, Ke Yi Duke University University of Aarhus.
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.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2015.
Presenter : Kuang-Jui Hsu Date : 2011/3/24(Thur.).
Edge Maps: Representation of Consistent Flow, Error and Uncertainty Publications: H. Bhatia, S. Jadhav, P.-T. Bremer, G. Chen, J.A. Levine, L.G. Nonato,
Docking III: Matching via Critical Points Yusu Wang Joint Work with P. K. Agarwal, H. Edelsbrunner, J. Harer Duke University.
CHAPTER 5 CONTOURING. 5.3 CONTOURING Fig 5.7. Relationship between color banding and contouring Contour line (isoline): the same scalar value, or isovalue.
Data Structures & Algorithms Graphs Richard Newman based on book by R. Sedgewick and slides by S. Sahni.
GRAPHS. Graph Graph terminology: vertex, edge, adjacent, incident, degree, cycle, path, connected component, spanning tree Types of graphs: undirected,
Riccardo Fellegara University of Genova Genova, Italy
Lecture 3 : Isosurface Extraction. Isosurface Definition  Isosurface (i.e. Level Set ) :  Constant density surface from a 3D array of data  C(w) =
CSE554Contouring IISlide 1 CSE 554 Lecture 3: Contouring II Fall 2011.
CSE554Contouring IISlide 1 CSE 554 Lecture 5: Contouring (faster) Fall 2013.
A global approach Finding correspondence between a pair of epipolar lines for all pixels simultaneously Local method: no guarantee we will have one to.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
ACM-GIS Morphology-Driven Simplification and Multiresolution Modeling of Terrains Emanuele Danovaro, Leila De Floriani, Paola Magillo, Mohammed.
Discrete Optimization Lecture 3 – Part 1 M. Pawan Kumar Slides available online
A Combined Geometrical and Topological Simplification Hierarchy for Terrain Analysis Leila De Floriani University of Genova Federico Iuricich University.
3D Object Representations 2009, Fall. Introduction What is CG?  Imaging : Representing 2D images  Modeling : Representing 3D objects  Rendering : Constructing.
Energy minimization Another global approach to improve quality of correspondences Assumption: disparities vary (mostly) smoothly Minimize energy function:
CSE 554 Lecture 5: Contouring (faster)
The minimum cost flow problem
Towards Topology-Rich Visualization/Analysis
Jeremy Bolton, PhD Assistant Teaching Professor
Finite Element Surface-Based Stereo 3D Reconstruction
Lecture 3 : Isosurface Extraction
Volume Graphics (lecture 4 : Isosurface Extraction)
Graph Operations And Representation
Quasi-linear algorithms for the topological watershed
Chapter 5: Morse functions and function-induced persistence
Presentation transcript:

Critical points and flow structure for density data Joint work with H. Edelsbrunner, J. Harer, and V. Pascucci Vijay Natarajan Duke University

Problem Define Morse-Smale complexes for 3-manifolds and give an algorithm to construct them for piecewise linear data Given smooth generic function f :  3  R

Motivation Density function f : R 3  R X-ray crystallography electron density Medical imaging (MRI) proton density Lattice dislocation atom energy Electron microscopy atom density

p Critical Points Have zero gradient minimum1-saddle2-saddlemaximum regular upper link (continent) lower link (ocean) Characterized by lower link

Ascending 3-cell of a minimum Ascending/Descending Manifolds Ascending manifold: Points with common origin. Descending manifold: Points with common destination.

Desc mfldAsc mfld Min0-cell3-cell 1-saddle1-cell2-cell 2-saddle2-cell1-cell Max3-cell0-cell 1-saddle2-saddle

Morse-Smale Complex Overlay of Asc and Desc manifolds

Morse-Smale Complex A cell is a connected component of points with common origin and destination Node Arc Quadrangle Crystal

Continuous to Piecewise Linear Input: tetrahedral mesh, density at vertices Critical points characterized by lower link Quasi Morse-Smale complexes –same combinatorial property –cells monotonic and non-crossing 1-saddle + 2-saddle

Morse-Smale Complex Construction 0. Sort Vertices 1.Downward sweep descending 1- and 2-manifolds (arcs and disks) 2.Upward sweep ascending 1- and 2-manifolds (arcs and disks) Asc arc Desc arc

High Level Operations Starting (at 1-saddles) Extending (at all vertices) Gluing ( at minima) Desc arc construction

i.Construct short cycle passing thru q around annulus ii.Add triangles from p to fill disk S TART D ISK

Simultaneous Construction At p : 1.1. Start  1 desc disks 1.2. Extend desc disks touching p 1.3. Start (  0 –1) desc arcs 1.4. Extend desc arcs touching p p  0 = 2 oceans  1 +1 = 2 continents

0. Sort Vertices 1.Downward sweep descending 1- and 2-manifolds (arcs and disks) 2.Upward sweep ascending 1- and 2-manifolds (arcs and disks) Asc arc Desc arc Morse-Smale Complex Construction

Substructures Descending / Ascending arcs –filter using density threshold –display corresponding isosurface Descending / Ascending disks –overlay on isosurfaces Crystals

Future work Case studies –dislocation study –x-ray crystallography Hierarchy –cancel pairs of critical points –order by persistence

References H. Edelsbrunner, J. Harer, V. Natarajan and V. Pascucci. Morse-Smale complexes for piecewise linear 3-manifolds. ACM Symposium on Computational Geometry, P. T. Bremer, H. Edelsbrunner, B. Hamann and V. Pascucci. A Multi-resolution Data Structure for Two-dimensional Morse Functions. IEEE Visualization, H. Edelsbrunner, J. Harer and A. Zomorodian. Hierarchical Morse-Smale complexes for piecewise linear 2-manifolds. Discrete and Computational Geometry, 2003.

No time for another slide !!

Simulating Disjointness Normal interval –order disks passing through a triangle Normal disk –order disks and arcs passing through an edge

Ascending Disks