Back to Top [an error occurred while processing this directive]
[an error occurred while processing this directive] [an error occurred while processing this directive]

Short Courses

The IMR short courses will be held Sunday, October 12, 2014. Courses are taught by internationally known experts in the field of Mesh Generation. Each course is an hour and a half in length including breaks. Instructors will address practical issues in the design and implementation of both structured and unstructured mesh generation codes.

These courses are ideal for students just entering the field who may need a foundation for research as well as any seasoned professionals who would like to expand their current skill set in the development of mesh and grid generation algorithms. To register for the short courses, mark the appropriate boxes on the registration form.


Instructor Bios and Course Abstracts

Dr. Steven J. Owen, Sandia National Laboratories

Title: Introduction to Quadrilateral and Hexahedral Mesh Generation

Biography: Steve Owen is currently a researcher and software developer at Sandia National Laboratories and has been a member of the CUBIT development team for the past 15 years. Hexahedral mesh generation and its related technologies have been the focus of his activities for the majority of his career. Steve graduated from Carnegie Mellon University in 1999 with a PhD in Civil Engineering and undergrad from Brigham Young University in 1992. Steve was awarded the IMR Fellow award at the 2013 IMR in Florida for his research accomplishments in meshing and contributions to the International Meshing Roundtable over the past two decades.

Abstract: This short course reviews the theory and application of quadrilateral and hexahedral mesh generation. We first define the use cases for hex meshing over traditional tetrahedral methods and why the general all-hex problem is fundamentally more difficult. Beginning with basic transfinite interpolation methods and exploring various advancing front and overlay grid approaches we will describe a wide range of all-hex methods currently in use today. We will also review mesh modification and improvement strategies for all-hex meshes including topology operations, smoothing, refinement and coarsening. More recent research strategies that utilize dual-based technologies, frame fields and parallel methods will also be discussed.

François Pellegrini, Université de Bordeaux

Title: Partitioning and Mapping Unstructured Meshes on Distributed Memory Architectures

Biography: François Pellegrini is a professor in informatics at Université de Bordeaux, and a researcher at LaBRI and at Inria Bordeaux.

He has been investigating the problems of graph partitioning and static mapping for more than 20 years, by designing both sequential and parallel heuristics.

He is the architect and main developer of the Scotch and PT-Scotch software. He is also at the inception of the PaMPA parallel library for distributed mesh handling, partitioning and remeshing.

Abstract: This course focuses on the use of partitioning and mapping tools for efficient parallel execution of unstructured mesh software.

We will discuss the following topics:
  • Current trends in parallel architectures
  • Desirable features for writers of numerical solvers based on unstructured meshes
  • The partitioning and static mapping problems
  • Classical algorithms to solve these problems
  • The graph representation of meshes
  • The hypergraph representation of meshes
  • Representing and using centralized graphs (e.g. in Scotch)
  • Representing and using distributed graphs (e.g. in PT-Scotch)
  • Representing and using distributed meshes (e.g. in PaMPA)

Mark Gammon, Product Manager, CADfix

Title: CAD Cleanup for Meshing

Biography: Since joining TranscenData 19 years ago as an application engineer Mark, has worked in most areas of CADfix software development, ranging from CAD translation to user interface and mesh generation. Mark is now the product manager for CADfix and leads the software development team.

Abstract: Being able to receive real-world 3D models from modern CAD systems is a key requirement of any mesh generation tool or mesh related research activity. At least for the near future most modern CAD systems will export their 3D models using a standard boundary representation (BREP) of the 3D volume they define, usually exported in one of many file formats available (IGES, STEP, ACIS, Parasolid, etc…). Fundamentally a BREP definition of a 3D volume is not a mathematically watertight description, and this short course will explain and demonstrate the various ways in which BREP models can "leak". However a leaky BREP definition is just the first of many ways in which a modern 3D CAD model definition can present the meshing developer with problems. Curve and surface "quality" (G0, G1, C1, G2, etc) are also high up the list of usual suspects when it comes to meshing failures, but there are many other issues close behind. This short course will present a practical introduction to the various ways a modern CAD model can trip up the meshing developer, and describe the tips and tricks available to help cope with the problems, again from a practical, software engineering point of view.

Dr. Hang Si, Weierstrass Institute (WIAS)

Title: Introduction to Delaunay-based Tetrahedral Mesh Generation

Biography: Hang Si is employed by Weierstrass Institute (WIAS) in Berlin. His main research interest is tetrahedral mesh generation and the discrete and computational geometry problems behind it. The goal is to develop efficient algorithms for automatically generating tetrahedral meshes suitable for numerical methods such as finite element and finite volume methods. He developed the software, TetGen, a Delaunay tetrahedral mesh generator. It is freely available for academic use.

Hang Si received his B.S. in Electrical Engineering from Hangzhou University (now merged in Zhejiang University) in 1994, and his M.S. in Computer Sciense from Zhejiang University in 2002. He joined the research group Numerical Mathematics and Scientific Computing of WIAS in 2002. He received his Ph.D from the Institute of Mathematics of Technische Universitaet Berlin in 2008.

Abstract: Delaunay triangulation has many nice properties and is popularly used in many mesh generation methods. However, to automatically generate good quality tetrahedral meshes is still challenged by many theoretical and practical issues. The aims of this short course are:

(i) to give an overview of the most fundamental problems in Delaunay-based tetrahedral mesh generation, and

(ii) to introduce classical and recent algorithms that are both theoretically correct and efficient in practice.

The topics include Delaunay and weighted Delaunay tetrajedralizations of point sets, constrained Delaunay tetrahedralizations from a set of constraints (edges and facets), and quality tetrahedral mesh generation for 3d polyhedral domains. Techniques to achieve a robust and efficient implementation will be addressed.

[an error occurred while processing this directive] [an error occurred while processing this directive]