THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-Neto Department of Computing Federal University.

Slides:

Advertisements

Similar presentations

Multi-chart Geometry Images Pedro Sander Harvard Harvard Hugues Hoppe Microsoft Research Hugues Hoppe Microsoft Research Steven Gortler Harvard Harvard.

Advertisements

Fast Adaptive Hybrid Mesh Generation Based on Quad-tree Decomposition

 Over-all: Very good idea to use more than one source. Good motivation (use of graphics). Good use of simplified, loosely defined -- but intuitive --

LaGriT Los Alamos Grid Toolbox Carl Gable meshing.lanl.gov lagrit.lanl.gov.

Surface Simplification Using Quadric Error Metrics Speaker: Fengwei Zhang September

© Fluent Inc. 4/16/ Introductory GAMBIT Notes GAMBIT v2.0 Jan 2002 Fluent User Services Center Edge and Face Meshing.

The analysis of the two dimensional subsonic flow over a NACA 0012 airfoil using OpenFoam is presented. 1) Create the geometry and the flap Sequence of.

Extended Gaussian Images

Based on paper by C.S. Chong, A. Senthil Kumar, H.P. Lee

Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 

Discrete Geometry Tutorial 2 1

Inter-Surface Mapping John Schreiner, Arul Asirvatham, Emil Praun (University of Utah) Hugues Hoppe (Microsoft Research)

Copyright © 2010 Altair Engineering, Inc. All rights reserved.Altair Proprietary and Confidential Information Section 8: Mesh Quality.

3D spherical gridding based on equidistant, constant volume cells for FV/FD methods A new method using natural neighbor Voronoi cells distributed by spiral.

An Introduction to Unstructured Mesh Generation Material tret de: S. J. Owen, "A Survey of Unstructured Mesh Generation Technology", Proceedings 7th International.

A Bezier Based Approach to Unstructured Moving Meshes ALADDIN and Sangria Gary Miller David Cardoze Todd Phillips Noel Walkington Mark Olah Miklos Bergou.

1cs542g-term Notes. 2 Meshing goals  Robust: doesn’t fail on reasonable geometry  Efficient: as few triangles as possible Easy to refine later.

High-Quality Simplification with Generalized Pair Contractions Pavel Borodin,* Stefan Gumhold, # Michael Guthe,* Reinhard Klein* *University of Bonn, Germany.

Stefan Gumhold,* Pavel Borodin, # Reinhard Klein # *University of Tuebingen, Germany # University of Bonn, Germany Intersection Free Simplification.

Presented by David Stavens. Autonomous Inspection Compute a path such that every point on the boundary of the workspace can be inspected from some point.

Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.

Tetra-Cubes: An algorithm to generate 3D isosurfaces based upon tetrahedra BERNARDO PIQUET CARNEIRO CLAUDIO T. SILVA ARIE E. KAUFMAN Department of Computer.

Content Subdivision First some basics (control point polygon, mesh)

Randomized Planning for Short Inspection Paths Tim Danner Lydia E. Kavraki Department of Computer Science Rice University.

A TABU SEARCH APPROACH TO POLYGONAL APPROXIMATION OF DIGITAL CURVES.

Delaunay Triangulations for 3D Mesh Generation Shang-Hua Teng Department of Computer Science, UIUC Work with: Gary Miller, Dafna Talmor, Noel Walkington.

UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2004 Chapter 4: 3D Convex Hulls Monday, 2/23/04.

NEW APPROACH TO CALCULATION OF RANGE OF POLYNOMIALS USING BERNSTEIN FORMS.

Part Two Multiresolution Analysis of Arbitrary Meshes M. Eck, T. DeRose, T. Duchamp, H. Hoppe, M. Lounsbery, W. Stuetzle SIGGRAPH 95.

Visualization and graphics research group CIPIC January 21, 2003Multiresolution (ECS 289L) - Winter Surface Simplification Using Quadric Error Metrics.

Geometric Probing with Light Beacons on Multiple Mobile Robots Sarah Bergbreiter CS287 Project Presentation May 1, 2002.

A New Algorithm for Solving Many-objective Optimization Problem Md. Shihabul Islam ( ) and Bashiul Alam Sabab ( ) Department of Computer Science.

Modeling and representation 1 – comparative review and polygon mesh models 2.1 Introduction 2.2 Polygonal representation of three-dimensional objects 2.3.

Socorro G.V. (1), Ruiz-Gironés E. (2), Oliver A. (1), Cascón J.M. (3), Escobar J.M. (1), Sarrate J. (2) and Montenegro R. (1) CMN June 29 – July.

Efficient Model Selection for Support Vector Machines

Gwangju Institute of Science and Technology Intelligent Design and Graphics Laboratory Multi-scale tensor voting for feature extraction from unstructured.

Grid Generation.

Surface Simplification Using Quadric Error Metrics Michael Garland Paul S. Heckbert.

Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.

4/15/04© University of Wisconsin, CS559 Spring 2004 Last Time More modeling: –Hierarchical modeling –Instancing and Parametric Instancing –Constructive.

Dynamic Meshing Using Adaptively Sampled Distance Fields

Mesh Generation 58:110 Computer-Aided Engineering Reference: Lecture Notes on Delaunay Mesh Generation, J. Shewchuk (1999)

A lightweight approach to repairing digitized polygon meshes Marco Attene IMATI-GE / CNR 2010 Presented by Naitsat Alexander.

PIMA-motivation PIMA: Partition Improvement using Mesh Adjacencies  Parallel simulation requires that the mesh be distributed with equal work-load and.

The Fast Optimal Voltage Partitioning Algorithm For Peak Power Density Minimization Jia Wang, Shiyan Hu Department of Electrical and Computer Engineering.

An Approach to Combined Laplacian and Optimization-Based Smoothing for Triangular, Quadrilateral, and Quad- Dominant Meshes Scott A. Canann, Joseph R.

B.Sc. Matej Gomboši Determining differences between two sets of polygons Laboratory for Geometric Modelling and Multimedia Algorithms Faculty of Electrical.

Surface Meshing Material tret de: S. J. Owen, "A Survey of Unstructured Mesh Generation Technology", Proceedings 7th International Meshing Roundtable,

Problem Definition: Solution of PDE’s in Geosciences  Finite elements and finite volume require: u 3D geometrical model u Geological attributes and u.

Adaptive Meshing Control to Improve Petascale Compass Simulations Xiao-Juan Luo and Mark S Shephard Scientific Computation Research Center (SCOREC) Interoperable.

Duy & Piotr. How to reconstruct a high quality image with the least amount of samples per pixel the least amount of resources And preserving the image.

Lee Byung-Gook Dongseo Univ.

Zl1 A sharpness dependent filter for mesh smoothing Chun-Yen Chen Kuo-Young Cheng available in CAGD Vol.22. 5(2005)

BOĞAZİÇİ UNIVERSITY – COMPUTER ENGINEERING Mehmet Balman Computer Engineering, Boğaziçi University Parallel Tetrahedral Mesh Refinement.

Shape Reconstruction from Samples with Cocone Tamal K. Dey Dept. of CIS Ohio State University.

Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.

Rendering Large Models (in real time)

June 23, Variational tetrahedral meshing of mechanical models for FEA Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’08 Conference, Orlando, Florida.

APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.

Unit 11: 3-Dimensional Geometry

Decimation Of Triangle Meshes

CS475 3D Game Development Level Of Detail Nodes (LOD)

Mesh Control through Boundary Layers and Face Vertex Types

Unit 11: 3-Dimensional Geometry

Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.

Geometric Solids All bounded three-dimensional geometric figures. Examples: Sphere, Cylinders, Cubes, Cones, Pyramids, and Prisms.

Simplification and Improvement of Tetrahedral Models for Simulation

Delaunay Triangulation & Application

CSE 554 Lecture 3: Shape Analysis (Part II)

Presentation transcript:

THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-Neto Department of Computing Federal University of Ceará, Brazil CRAbUFC PUC-Rio

THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Introduction Mesh generation strategy Back-tracking strategy Validation studies Future directions Conclusions

Introduction There is a wide variety of techniques in the literature for mesh generation: Watson, 1981 Joe, 1990 Many others Delaunay THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Introduction There is a wide variety of techniques in the literature for mesh generation: Watson, 1981 Joe, 1990 Many others Yerry and Shephard, 1984 Perucchio et al., 1989 Many others Delaunay Octree THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Introduction There is a wide variety of techniques in the literature for mesh generation: Watson, 1981 Joe, 1990 Many others Yerry and Shephard, 1984 Perucchio et al., 1989 Many others Peraire et al., 1988 Lohner and Parikh, 1988 Moller and Hansbo, 1995 Many others Delaunay Octree Advancing-front THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Introduction Objective of the work: Propose a new strategy to generate meshes in 3D Strategy is based on a back-tracking idea It should deal with cracks THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Introduction Objective of the work: Propose a new strategy to generate meshes in 3D Strategy is based on a back-tracking idea It should deal with cracks Requirements: Produces well shaped elements, avoiding elements with poor aspect ratios Generates a mesh that conforms to an existing boundary mesh of the model Has the ability to transition well between regions of highly varying size elements Deals with cracks in a robust and efficient way THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Octree generation: Initialization based on boundary mesh Refinement for maximum cell size Refinement for minimum size disparity Advancing-front procedure: Geometry-based element generation Topology-based element generation Back-tracking element generation Local mesh improvement: Laplacian Smoothing with checks Back-tracking optimization THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Octree generation: Initial boundary mesh THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Octree generation: Initialization based on boundary mesh THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Region with many cells

Mesh generation strategy Octree generation: Refinement for maximum cell size THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Cell refined

Mesh generation strategy Octree generation: Refinement for minimum size disparity THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Cell refined

Mesh generation strategy Advancing-front procedure: Geometry-based element generation Base face chosen from the list of active faces Candidate vertices found Optimal region for a vertex defined Search for existing vertices in the optimal region performed New vertex is created if none is found Additional geometric checks are performed Cracks are treated List of faces is updated THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Advancing-front procedure: Geometry-based element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Optimal vertex N1

Mesh generation strategy Advancing-front procedure: Geometry-based element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Advancing-front procedure: Topology-based element generation Base face chosen from the list of faces that failed Candidate vertices found Any vertex is considered Proximity checks for optimization performed Additional geometric checks performed Cracks are treated List of faces is updated THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Advancing-front procedure: Back-tracking element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Advancing-front procedure: Back-tracking element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Element to be deleted (a,b,c,d) Unmeshable region

Mesh generation strategy Advancing-front procedure: Back-tracking element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Element to be deleted (a,b,c,d) Meshable region Unmeshable region

Mesh generation strategy Advancing-front procedure: Back-tracking element generation THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Element to be deleted (a,b,c,d) Meshable region Region meshed Unmeshable region

Mesh generation strategy Local mesh improvement: Laplacian smoothing with checks THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Mesh generation strategy Local mesh improvement: Back-tracking optimization THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Bad element (in gray)

Back-tracking strategy General description (definitions): E k => element to be considered R(E k ) => local region in the neighborhood of E k M(E) => set of all mesh elements D(E k ) => set of deleted elements for E k (during back-tracking) F(E k ) => set of new generated elements for R(E k ) THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Back-tracking strategy General description (general algorithm): Determine region R(E k ) for given element E k R(E k ) THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Back-tracking strategy General description (general algorithm): Determine region R(E k ) for given ill-shaped element E k Perform visibility tests for region R(E k ) Check if R(E k ) is a star-shaped region R(E k ) Star-shaped? THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Back-tracking strategy General description (general algorithm): Determine region R(E k ) for given ill-shaped element E k Perform visibility tests for region R(E k ) Check if R(E k ) is a star-shaped region If there are intersections: Update R(E k ) by R(E k ) new = R(E k ) old – D(E k ) Update M(E) by M(E) new = M(E) old – D(E k ) R(E k ) Star-shaped? Update R(E k ) Update M(E) No THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Back-tracking strategy General description (general algorithm): Determine region R(E k ) for given ill-shaped element E k Perform visibility tests for region R(E k ) Check if R(E k ) is a star-shaped region If there are intersections: Update R(E k ) by R(E k ) new = R(E k ) old – D(E k ) Update M(E) by M(E) new = M(E) old – D(E k ) Repeat the process until a kernel is found. Then: Find the set of new elements F(E k ) Update M(E) by M(E) new = M(E) old + F(E k ) R(E k ) Star-shaped? Find F(E k ) Update M(E) End Update R(E k ) Update M(E) Yes No THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Two-dimensional Back-tracking R(E k ) => P(T k ) P => polygon T => triangle M(E) => M(T) D(E k ) => D(T k ) F(E k ) => F(T k ) P(T k ) Star-shaped? Find F(T k ) Update M(T) End Update P(T k ) Update M(T) Yes No THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Two-dimensional Back-tracking Element to be deleted (in gray) THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Two-dimensional Back-tracking Element to be deleted (in gray) New region THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Two-dimensional Back-tracking Element to be deleted (in gray) New elements New region THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Three-dimensional Back-tracking R(E k ) => P(T k ) P => polyhedron T => tetrahedron M(E) => M(T) D(E k ) => D(T k ) F(E k ) => F(T k ) P(T k ) Star-shaped? Find F(T k ) Update M(T) End Update P(T k ) Update M(T) Yes No THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Three-dimensional Back-tracking Element to be deleted (a,b,c,d) THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Three-dimensional Back-tracking Element to be deleted (a,b,c,d) New region THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Three-dimensional Back-tracking Element to be deleted (a,b,c,d) New elements New region THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Quality measures: V => volume of a tetrahedron Si => length of an edge Optimal value => 8.5 Range => [ 1,  ] Threshold: Lower bound => 5.0 Upper bound => 8.5*factor(30) Use of metric (Parthasarathy et al., 1993): Sensitive to small changes Computationally efficient Any metric can be used Definition of ill-shaped element THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Quality measures:  = 3R i / R c R i => radius of inscribed sphere R c => radius of circumscribed sphere Optimal value => 1.0 Range => [ 0,  ] Threshold: Lower bound => 0.2 Upper bound => 0.5 Use of metric: More intuitive interpretation Widely used in the literature Any metric can be used Evaluation of element quality THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 1: A portion of a housing THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 1: A portion of a housing THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Crack

Validation studies Example 1: A portion of a housing Element quality % of elements  Before After THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 1: A portion of a housing Element quality % of elements  Before After Very poor elements Best elements THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 2: A portion of a spiral-bevel gear THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 2: A portion of a spiral-bevel gear THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Crack

Validation studies Example 2: A portion of a spiral-bevel gear Element quality % of elements  Before After THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 2: A portion of a spiral-bevel gear Element quality % of elements  Before After THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Very poor elements Best elements

Validation studies Example 3: A portion of a turbofan hub THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 3: A portion of a turbofan hub THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007 Crack

Validation studies Example 3: A portion of a turbofan hub Element quality % of elements  Before After THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Example 3: A portion of a turbofan hub Element quality % of elements  Before After Very poor elements Best elements THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Table for comparison ExampleHistogram#Elements  avg  min  max HousingBefore HousingAfter GearBefore GearAfter TurbofanBefore TurbofanAfter THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Table for comparison ExampleHistogram#Elements  avg  min  max HousingBefore HousingAfter GearBefore GearAfter TurbofanBefore TurbofanAfter Increases THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Validation studies Table for comparison ExampleHistogram#Elements  avg  min  max HousingBefore HousingAfter GearBefore GearAfter TurbofanBefore TurbofanAfter Increases Decreases THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Future directions Back-tracking strategy More tests Convergence studies Implementation of the strategy in parallel Based on the octree cells Does not need domain subdivision Automatic modification of boundary meshes Have to meet advancing-front requirements Mesh generation for multi-domains models Treatment of multi-connected regions THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007

Conclusions Strategy proposed is based on a Back-tracking idea It is an iterative process than can converge or not Original configuration for each region is “saved” for recuperation Mesh improvement attested by validation studies Input mesh has already good quality % of very poor elements drops significantly (to 0.49% %) % of best elements increases (around 2% to 4%) In large models, this % can be very representative Convergence studies would be welcomed THREE-DIMENSIONAL UNSTRUCTURED MESH GENERATION FOR ARBITRARY DOMAINS WITH CRACKS Joaquim Bento Cavalcante-NetoAgosto,2007