5-11-2005Lamps of Aladdin1 Moving Mesh Adaptation Techniques Todd Phillips Gary Miller Mark Olah.

Slides:



Advertisements
Similar presentations
Steady-state heat conduction on triangulated planar domain May, 2002
Advertisements

13-Optimization Assoc.Prof.Dr. Ahmet Zafer Şenalp Mechanical Engineering Department Gebze Technical.
The fundamental matrix F
Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September
1 Using ANN to solve the Navier Stoke Equations Motivation: Solving the complete Navier Stokes equations using direct numerical simulation is computationally.
P. Venkataraman Mechanical Engineering P. Venkataraman Rochester Institute of Technology DETC2013 – 12269: Continuous Solution for Boundary Value Problems.
5/2/2007Don Sheehy Overlay Stitch Meshing 1. 5/2/2007Don Sheehy Overlay Stitch Meshing 2 A competitive algorithm for no-large-angle triangulation Don.
ECE 8443 – Pattern Recognition ECE 8423 – Adaptive Signal Processing Objectives: The FIR Adaptive Filter The LMS Adaptive Filter Stability and Convergence.
A Simple and Robust Thinning Algorithm on Cell Complexes
1 Minimum Ratio Contours For Meshes Andrew Clements Hao Zhang gruvi graphics + usability + visualization.
Nice, 17/18 December 2001 Adaptive Grids For Bathymetry Mapping And Navigation Michel Chedid and Maria-João Rendas I3S - MAUVE.
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.
Developments on Shape Optimization at CIMNE October Advanced modelling techniques for aerospace SMEs.
CENG 789 – Digital Geometry Processing 05- Smoothing and Remeshing
x – independent variable (input)
A posteriori Error Estimate - Adaptive method Consider the boundary value problem Weak form Discrete Equation Error bounds ( priori error )
Numerical geometry of non-rigid shapes
5/2/2007Don Sheehy Overlay Stitch Meshing 1. 5/2/2007Don Sheehy Overlay Stitch Meshing 2 A competitive algorithm for no-large-angle triangulation Don.
Motion Analysis (contd.) Slides are from RPI Registration Class.
Prénom Nom Document Analysis: Data Analysis and Clustering Prof. Rolf Ingold, University of Fribourg Master course, spring semester 2008.
Feature Sensitive Surface Extraction from Volume Data Leif P. Kobbelt Mario Botsch Ulrich Schwanecke Hans-Peter Seidel Computer Graphics Group, RWTH-Aachen.
1 Mesh Generation and Delaunay-Based Meshes Jernej Barbic Computer Science Department Carnegie Mellon University.
Non-Euclidean Embedding
Seminar 1 Surface Rendering, Decimation Presented By Sonali Barua Date:10/31/2005.
Delaunay Triangulations for 3D Mesh Generation Shang-Hua Teng Department of Computer Science, UIUC Work with: Gary Miller, Dafna Talmor, Noel Walkington.
Advanced Topics in Optimization
1 Numerical geometry of non-rigid shapes Non-Euclidean Embedding Non-Euclidean Embedding Lecture 6 © Alexander & Michael Bronstein tosca.cs.technion.ac.il/book.
Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.
Beam Design for Geometric Nonlinearities
Good Triangulations and Meshing Lecturer: Ofer Rothschild 1.
CHAPTER 15 S IMULATION - B ASED O PTIMIZATION II : S TOCHASTIC G RADIENT AND S AMPLE P ATH M ETHODS Organization of chapter in ISSO –Introduction to gradient.
Domain decomposition in parallel computing Ashok Srinivasan Florida State University COT 5410 – Spring 2004.
Dr. Hala Moushir Ebied Faculty of Computers & Information Sciences
Motion Blending (Multidimensional Interpolation) Jehee Lee.
Grid Generation.
 Coding efficiency/Compression ratio:  The loss of information or distortion measure:
AAU A Trajectory Splitting Model for Efficient Spatio-Temporal Indexing Presented by YuQing Zhang  Slobodan Rasetic Jorg Sander James Elding Mario A.
Dual/Primal Mesh Optimization for Polygonized Implicit Surfaces
Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.
Introduction to variable selection I Qi Yu. 2 Problems due to poor variable selection: Input dimension is too large; the curse of dimensionality problem.
Machine Learning1 Machine Learning: Summary Greg Grudic CSCI-4830.
1 Approximation Through Scaling Algorithms and Networks 2014/2015 Hans L. Bodlaender Johan M. M. van Rooij.
1 Numerical Shape Optimisation in Blow Moulding Hans Groot.
Neural and Evolutionary Computing - Lecture 6
EDGE DETECTION IN COMPUTER VISION SYSTEMS PRESENTATION BY : ATUL CHOPRA JUNE EE-6358 COMPUTER VISION UNIVERSITY OF TEXAS AT ARLINGTON.
A Segmentation Algorithm Using Dyadic Wavelet Transform and the Discrete Dynamic Contour Bernard Chiu University of Waterloo.
Images Similarity by Relative Dynamic Programming M. Sc. thesis by Ady Ecker Supervisor: prof. Shimon Ullman.
Stress constrained optimization using X-FEM and Level Set Description
© Fluent Inc. 11/24/2015J1 Fluids Review TRN Overview of CFD Solution Methodologies.
Mesh Coarsening zhenyu shu Mesh Coarsening Large meshes are commonly used in numerous application area Modern range scanning devices are used.
ECE-7000: Nonlinear Dynamical Systems Overfitting and model costs Overfitting  The more free parameters a model has, the better it can be adapted.
MECH4450 Introduction to Finite Element Methods Chapter 9 Advanced Topics II - Nonlinear Problems Error and Convergence.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Chapter1: Introduction Chapter2: Overview of Supervised Learning
3.7 Adaptive filtering Joonas Vanninen Antonio Palomino Alarcos.
Outline Introduction Research Project Findings / Results
MECH593 Introduction to Finite Element Methods
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
12 July 2007Gary Miller Overlay Stitch Meshing 1 Size Competitive Meshing without Large Angles Gary L. Miller Carnegie Mellon Computer Science Joint work.
Introduction to emulators Tony O’Hagan University of Sheffield.
1 Spherical manifolds for hierarchical surface modeling Cindy Grimm.
Understanding Generalization in Adaptive Data Analysis
ME 521 Computer Aided Design 15-Optimization
Domain-Modeling Techniques
Slides for Introduction to Stochastic Search and Optimization (ISSO) by J. C. Spall CHAPTER 15 SIMULATION-BASED OPTIMIZATION II: STOCHASTIC GRADIENT AND.
Introduction to Scientific Computing II
Delaunay Triangulation & Application
Concave Minimization for Support Vector Machine Classifiers
Presentation transcript:

Lamps of Aladdin1 Moving Mesh Adaptation Techniques Todd Phillips Gary Miller Mark Olah

Lamps of Aladdin2 Introduction The Meshing Problem –Discretize a Spatial Domain –Minimize Size (Number of Triangles) –Maximize Quality (Shape of Triangles) Mesh Adaptation –Introduce More Elements –Base Decisions on the Function being Interpolated How do we make such a decision?

Lamps of Aladdin3 The Basic Setup A Function Exists

Lamps of Aladdin4 The Basic Setup A Mesh Also Exists

Lamps of Aladdin5 The Basic Setup We Approximate the Function with the Mesh

Lamps of Aladdin6 The Basic Setup We can adapt the Mesh to Better Approximate the Function

Lamps of Aladdin7 Background: Local Feature Size What is Local Feature Size? –Roughly, the Size of Triangles We Should Be Using –The Smallest Distance to Two Geometric Domain Features Local Feature Size Should be k-Lipschitz –Doesn’t change too fast –For all p,q lfs(p) <= lfs(q) + k*dist(p,q) –This is like having derivative bounded by k.

Lamps of Aladdin8 Optimal Meshing and Adaptive Meshing Optimal Meshing –Consider the LFS of the Input Domain –Output a Mesh Triangle Size is within a constant of LFS Triangle Aspect Ratio is bounded –Note the Impossabilty of this if LFS is not Lipschitz Adaptive Meshing –LFS Accounts for Other ‘Features’ Provided by Some Oracle –Introduce Geometric Features to Accommodate –Perturb the Original Mesh to obtain a new Optimal Mesh

Lamps of Aladdin9 Example of Modifying Local Feature Size A Sample Geometric Domain

Lamps of Aladdin10 LFS of the Sample Domain Example of Modifying Local Feature Size

Lamps of Aladdin11 Modify the Geometric Domain to Capture a New Feature Example of Modifying Local Feature Size

Lamps of Aladdin12 LFS of the Modified Domain Example of Modifying Local Feature Size

Lamps of Aladdin13 How can we Define an Oracle? Function-Angle Based Refinement –Some Function is Approximated by the Mesh –This Embeds the Mesh as a surface in one-higher dimension –Observe the angle between faces of this surface –Introduce Features Where This Angle is Small Insert Circumcenters, Split Edges, etc.

Lamps of Aladdin14 An Example in One Dimension: Function

Lamps of Aladdin15 An Example in One Dimension: Function and Uniform Mesh

Lamps of Aladdin16 An Example in One Dimension: Function, Mesh, and Error

Lamps of Aladdin17 An Example in One Dimension: Function and Adaptive Mesh

Lamps of Aladdin18 An Example in One Dimension: Adaptive Mesh LFS

Lamps of Aladdin19 Will this work? Original Feature Size must be Small Enough Actual Function must be Differentiable

Lamps of Aladdin20 Practicalities Real Mesh Adaptation Requires Coarsening As Well –Sometimes Functional Features Move or Disappear –Thrashing is a dirty word Real Solutions aren’t always differentiable –Give up after a Minimum Feature Size

Lamps of Aladdin21 Why is this so great for Moving Meshes? Unlike the One Dimensional Movie –Fixed Mesh ( Grid points didn’t move left/right ) –Constantly ‘Chasing’ the Feature Mesh moves with the Velocity Function –Hence, Mesh moves with the Velocity features –After features are captured, very little Mesh Adaptation

Lamps of Aladdin22 How does this compare to other methods? Sensitivity Analysis and a posteriori Error Estimates –Double the Mesh Size Everywhere, compare solutions –Require multiple meshes of different sizing be maintained –Require multiple solves at every iteration –Don’t take advantage of Moving Mesh (Persistance of Features)

Lamps of Aladdin23 Some 2-D Examples

Lamps of Aladdin24 Some 2-D Examples

Lamps of Aladdin25 Conclusion Summary –Use an oracle based on Function-Angles –Introduce new geometric features –Use existing geometrically driven meshing algorithms Future –Tighter Coupling of Oracle with Meshing Algorithms –Adaptive Time Refinement