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

Slides:



Advertisements
Similar presentations
AI Pathfinding Representing the Search Space
Advertisements

1 st Meeting, Industrial Geometry, 2005 Approximating Solids by Balls (in collaboration with subproject: "Applications of Higher Geometrics") Bernhard.
 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.
Efficient High-Resolution Stereo Matching using Local Plane Sweeps Sudipta N. Sinha, Daniel Scharstein, Richard CVPR 2014 Yongho Shin.
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Getting A Speeding Ticket. Mesh Generation 2D Point Set Delaunay Triangulation 3D Point Set Delaunay Tetrahedralization.
Advanced Manufacturing Laboratory Department of Industrial Engineering Sharif University of Technology Session # 8.
Mesh, Loads & Boundary conditions CAD Course © Dr Moudar Zgoul,
Convex Hulls in Two Dimensions Definitions Basic algorithms Gift Wrapping (algorithm of Jarvis ) Graham scan Divide and conquer Convex Hull for line intersections.
Ruslana Mys Delaunay Triangulation Delaunay Triangulation (DT)  Introduction  Delaunay-Voronoi based method  Algorithms to compute the convex hull 
Informationsteknologi Wednesday, November 7, 2007Computer Graphics - Class 51 Today’s class Geometric objects and transformations.
The Effect of T-Stiffener Web and Flange Tilt on Frame Stress Evaluated using Finite Element Analysis by Dean Pasquerella MASTER OF ENGINEERING Major Subject:
Department of Mechanical Engineering 1 Meshing of 2-D Cross Section Mesh Tool Comparison Group: Graden Hardy, Patrick Lewis Date:22 April 2009 ME 501 –
VIRTUAL ARTHROSCOPIC KNEE SURGERY TRANING SYSTEM Yang Xiaosong The Chinese University of Hong Kong Tsinghua University.
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.
Section 4: Implementation of Finite Element Analysis – Other Elements
CSE554ContouringSlide 1 CSE 554 Lecture 4: Contouring Fall 2013.
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.
Delaunay Triangulation on the GPU Dan Maljovec. CPU Delaunay Triangulation Randomized Incremental Algorithm 1.Construct Bounding triangle 2.Choose point.
Surface Reconstruction from 3D Volume Data. Problem Definition Construct polyhedral surfaces from regularly-sampled 3D digital volumes.
UMass Lowell Computer Science Advanced Algorithms Computational Geometry Prof. Karen Daniels Spring, 2007 Chapter 5: Voronoi Diagrams Wednesday,
Modelling. Outline  Modelling methods  Editing models – adding detail  Polygonal models  Representing curves  Patched surfaces.
Filling Arbitrary Holes in Finite Element Models 17 th International Meshing Roundtable 2008 Schilling, Bidmon, Sommer, and Ertl.
June 29, The difference between two feature models Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’07 Conference, Honolulu, Hawaii Faculty of Electrical.
A Combinatorial Maximum Cover Approach to 2D Translational Geometric Covering Karen Daniels, Arti Mathur, Roger Grinde University of Massachusetts Lowell.
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)
reconstruction process, RANSAC, primitive shapes, alpha-shapes
Delaunay Triangulations for 3D Mesh Generation Shang-Hua Teng Department of Computer Science, UIUC Work with: Gary Miller, Dafna Talmor, Noel Walkington.
Quadtrees and Mesh Generation Student Lecture in course MATH/CSC 870 Philipp Richter Thursday, April 19 th, 2007.
Computer Science Lecture 12, page 1 CS677: Distributed OS Last Class Vector timestamps Global state –Distributed Snapshot Election algorithms.
COMPUTER-AIDED DESIGN The functionality of SolidWorks Simulation depends on which software Simulation product is used. The functionality of different producs.
Introduction to virtual engineering László Horváth Budapest Tech John von Neumann Faculty of Informatics Institute of Intelligent Engineering.
Morphological Analysis of 3D Scalar Fields based on Morse Theory and Discrete Distortion Mohammed Mostefa Mesmoudi Leila De Floriani Paola Magillo Dept.
Grid Generation.
Dobrina Boltcheva, Mariette Yvinec, Jean-Daniel Boissonnat INRIA – Sophia Antipolis, France 1. Initialization Use the.
On-line Space Sculpturing for 3D Shape Manipulation
Algorithms for Triangulations of a 3D Point Set Géza Kós Computer and Automation Research Institute Hungarian Academy of Sciences Budapest, Kende u
Accelerating Ray Tracing using Constrained Tetrahedralizations Ares Lagae & Philip Dutré 19 th Eurographics Symposium on Rendering EGSR 2008Wednesday,
3D Triangulations in Pierre Alliez.
Problem Definition: Solution of PDE’s in Geosciences  Finite elements and finite volume require: u 3D geometrical model u Geological attributes and u.
Managing the Level of Detail in 3D Shape Reconstruction and Representation Leila De Floriani, Paola Magillo Department of Computer and Information Sciences.
Visual Computing Geometric Modelling 1 INFO410 & INFO350 S2 2015
Stress constrained optimization using X-FEM and Level Set Description
CSC-305 Design and Analysis of AlgorithmsBS(CS) -6 Fall-2014CSC-305 Design and Analysis of AlgorithmsBS(CS) -6 Fall-2014 Design and Analysis of Algorithms.
A New Voronoi-based Reconstruction Algorithm
Universität Stuttgart Institute of Parallel and Distributed Systems (IPVS) Universitätsstraße 38 D Stuttgart Voronoi Overlay Networks Pavel Skvortsov.
9 of 18 Introduction to medial axis transforms and their computation Outline DefinitionsMAS PropertiesMAS CAD modelsTJC The challenges for computingTJC.
1 11. Polygons Polygons 2D polygons ( 다각형 ) –Polygon sides are all straight lines lying in the same plane 3D polyhedra ( 다면체 )  chap. 12 –Polyhedra.
Delaunay Triangulation on the GPU
Outline Introduction Research Project Findings / Results
BOĞAZİÇİ UNIVERSITY – COMPUTER ENGINEERING Mehmet Balman Computer Engineering, Boğaziçi University Parallel Tetrahedral Mesh Refinement.
CHAPTER 7 STATISTICAL PROCESS CONTROL. THE CONCEPT The application of statistical techniques to determine whether the output of a process conforms to.
UNC Chapel Hill M. C. Lin Delaunay Triangulations Reading: Chapter 9 of the Textbook Driving Applications –Height Interpolation –Constrained Triangulation.
Mesh Resampling Wolfgang Knoll, Reinhard Russ, Cornelia Hasil 1 Institute of Computer Graphics and Algorithms Vienna University of Technology.
APE'07 IV INTERNATIONAL CONFERENCE ON ADVANCES IN PRODUCTION ENGINEERING June 2007 Warsaw, Poland M. Nowakiewicz, J. Porter-Sobieraj Faculty of.
Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns Antony Galton University of Exeter UK.
Finite element mesh and load definition
Variational Tetrahedral Meshing
Decimation Of Triangle Meshes
FEA Introduction.
Procedural Animation Lecture 3: Types of 3D models
ATCM 6317 Procedural Animation
Meshing Strategy.
Delaunay Triangulation & Application
Iso-Surface extraction from red and green samples on a regular lattice
Topology Optimization through Computer Aided Software
Presentation transcript:

June 23, Variational tetrahedral meshing of mechanical models for FEA Matthijs Sypkens Smit Willem F. Bronsvoort CAD ’08 Conference, Orlando, Florida Faculty of Electrical Engineering, Mathematics and Computer Science

June 23, 2008 CAD’082 Outline Research motivation Variational tetrahedral meshing (VTM) The shortcomings of VTM for mechanical models Improvements / recommendations Results Conclusions

June 23, 2008 CAD’083 Research motivation (1) Analysis / product simulation: Reduces need to construct real world test models Decreases length of product development cycle Increases quality/safety Lowers total cost Most popular method: finite element analysis Requires a mesh / decomposition of geometry Can work with many types of meshes

June 23, 2008 CAD’084 Research motivation (2) Meshes and mesh quality: Zero bad quality elements Near regular elements in computational space Accurate representation of model boundary Efficient variation in sizing w.r.t. to accuracy Quality is context dependent. Generally: A higher quality mesh results in a quicker, more accurate, and more reliable analysis.

June 23, 2008 CAD’085 Research motivation (3) Variational tetrahedral meshing (VTM) offers: Exceptional quality distribution: Majority near regular elements Effectively no bad quality elements Mesh sizing VTM was not conceived for mechanical models.  We have investigated this application  We have made several improvements

June 23, 2008 CAD’086 Variational tetrahedral meshing (1) Central ideas: Delaunay mesh Optimisation through connectivity and node locations Boundary conformance as continuous process simultaneously executed with optimisation Delaunay property:

June 23, 2008 CAD’087 Variational tetrahedral meshing (2) Delaunay optimisation: Delaunay connectivity globally optimal Node relocation improves local quality  Combine these two into an optimisation procedure 1: 2: 3:

June 23, 2008 CAD’088 Variational tetrahedral meshing (3) Achieving boundary conformance: “Shape” the mesh by pulling the outer nodes towards the boundary:  Use boundary samples to perform pulling Separate treatment of corner, edge and face samples

June 23, 2008 CAD’089 Variational tetrahedral meshing (4) The role of boundary samples:

June 23, 2008 CAD’0810 Variational tetrahedral meshing (5)  Interior mesh optimising  Boundary shaping The algorithm: Initialise data structures Spread out nodes Optimisation loop Extract mesh

June 23, 2008 CAD’0811 Variational tetrahedral meshing (6) Mesh extraction: Delaunay mesh covers the convex hull Remove elements that are not part of the intended shape

June 23, 2008 CAD’0812 The weaker points of VTM (1) Points of attention for mechanical models: Boundary conformance  An accurate representation of the boundary should be present in the mesh Mesh extraction  An accurate representation of the boundary should result from Delaunay mesh extraction

June 23, 2008 CAD’0813 The weaker points of VTM (2) Boundary conformance: There is a risk that no set of tetrahedra exists in the mesh that is acceptable to represent the model boundary 3D: Tetrahedron “crossing” the boundary 2D: correct vs. “crossing”

June 23, 2008 CAD’0814 The weaker points of VTM (3) Mesh extraction: The heuristics for mesh extraction frequently fail to deliver an acceptable result Excess and missing tetrahedra after extraction:

June 23, 2008 CAD’0815 Improving the results (1) To get better results applying VTM on mechanical models, we must first understand the cause(s) of the defects. Boundary conformance: Why do we expect boundary conformance in our mesh? How can it go wrong? What can be done about it?

June 23, 2008 CAD’0816 Improving the results (2) Why do we expect boundary conformance? The boundary samples always pull on their closest node.  Result: (near) Gabriel edges and triangles everywhere on the boundary.

June 23, 2008 CAD’0817 Improving the results (3) How can boundary conformance fail? If the number of boundary samples is low, less of the boundary will be Gabriel.

June 23, 2008 CAD’0818 Improving the results (4) What can be done about it? The risk of failing boundary conformance can be reduced by increasing the number of boundary samples From experience: 10 samples per node on the boundary makes failure rare Caveat: Small dihedral angles

June 23, 2008 CAD’0819 Improving the results (5) Lack of resolution A geometry needs a certain amount of nodes for an accurate representation by a conforming Delaunay triangulation  Even with ample boundary samples, boundary conformance can still fail due to lack of nodes

June 23, 2008 CAD’0820 Improving the results (6) Detect lack of resolution and locally fix it Indication of lack of nodes:  Samples from different geometrical features are pulling on the same node Fix: split the node (= add a new node right next to it)

June 23, 2008 CAD’0821 Improving the results (7) Detect lack of resolution and locally fix it Example of how effective splitting is:  Start with one interior node and 54 corner nodes: continue splitting until no more splits occur Fix is a local solution; With many nodes missing better to start with more nodes

June 23, 2008 CAD’0822 Improving the results (8) Mesh extraction Improved mesh extraction logic: Project boundary nodes to model boundary Tetrahedra with an interior node are inside the model  Only tetrahedra with 4 boundary nodes left to consider If centroid of a tetrahedron falls outside, then tetrahedron outside the model Else tetrahedron inside the model

June 23, 2008 CAD’0823 Improving the results (9) Mesh extraction 2D example: Location of centroid is decisive Works for both concave and convex regions

June 23, 2008 CAD’0824 Results (1) Gear mesh

June 23, 2008 CAD’0825 Results (2) Gear volume-length ratio

June 23, 2008 CAD’0826 Results (3) Gear min/max dihedral angle

June 23, 2008 CAD’0827 Conclusions Number of boundary samples and number of nodes are important for success Node splitting is effective at enforcing boundary conformance Improved mesh extraction recovers the intended boundary Improved VTM can be used for the construction of meshes of mechanical models Results in high quality meshes of mechanical models

June 23, 2008 CAD’0828 Credits Research supported by NWO: Computational Geometry Algorithms Library (CGAL) was used in the creation of some of the illustrations