Short
CoursesShort
Courses
The
optional short courses, to be held the day before the opening of the Conference.
Three courses will be offered, taught by internationally known experts in the
field of Mesh Generation. The courses will run two hours in length and include
course notes and coffee breaks. Instructors will be addressing practical issues
in the design and implementation of both structured and unstructured mesh generation
codes.
The courses are ideal for students just entering the field needing a foundation for research, or forseasoned 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. The price is $100 per attendee which includes course materials. Enrollment for short courses is limited to the first 30 paid registrants. If insufficient enrollment, short courses may be subject to cancellation. In event of cancellation or over-enrollment, all tuition will be refunded.
| Time | Topic | Instructor(s) |
| 9:00 - 11:00 11:00-12:00 9:00 - 11:00 1:00 - 3:00 3:30 - 5:30 |
Unstructured Meshing (Introduction) Unstructured Meshing (Advanced) Digital Geometry Processing Global Optimization of Mesh Quality Optimality and Guaranteed Quality in Isoparametric Mesh Generation |
Steve Owen Steve Owen Peter Schreuder David Eppstein Stephen Vavasis |
TOPIC:
Unstructured Meshing (Introduction)
Steve Owen, Sandia National Laboratories
PART I:
Algorithms This short course will provide an introduction to the principal techniques
currently in use for constructing computational grids using unstructured methods.
Delaunay, advancing front and octree methods will be described with respect
to triangle and tetrahedral elements. An overview of current quadrilateral and
hexahedral methods will be provided, including medial axis, paving, q-morph,
sub-mapping, plastering, sweeping and whisker weaving as well as mixed element
methods such as hex-tet, h-morph and hybrid methods for CFD.
TOPIC:
Unstructured Meshing (Advanced)
Steve
Owen, Sandia National Laboratories
PART II: Real
World Mesh Generation Understanding the principal mesh generation algorithms
is only the first step in understanding what it takes to put together a mesh
generation toolkit that is usable within an industrial setting. This short course
attempts to address several topics that are necessary in order to understand
the complete meshing problem. An introduction to several topics including meshing
on CAD geometry, smoothing, topology improvement, mesh sizing control and adaptive
refinement methods will be among the topics discussed. An approach to how these
topics can be used within the context of a real world automatic meshing tool
will be presented.
TOPIC: Digital Geometry Processing
Peter Schreuder, California Institute of Technology
Digital Geometry Processing Previous generations of multimedia progressed from univariate (sound), to bivariate (image), and trivariate (video) signals. Digital signal processing and itsassociated toolbox of fundamental algorithms made these multimedia datatypes easy and efficient to compute with enabling entire industries. At the core these earlier signal processing algorithms were based on the Fourier transform. The latter is intricately linked to regular sampling and Euclidian domains. Because of this, earlier digital signal processing algorithms do not carry over to the next wave of multimedia: digital geometry. Complex 2-manifold surfaces cannot be sampled regularly, for example. This necessitates a wholly new apparatus for Digital Geometry Processing. Examples of such processing include denoising, enhancement, multiresolution representations, wavelets, compression, and methods for the solution of operator equations. In this short course I will give an overview of a number of algorithms and their underlying theory which have been developed for Digital Geometry Processing in the field of computer graphics.
TOPIC: COMPUTATIONAL GEOMETRY
David Eppstein, University of California, Irvine
Title: Global optimization of mesh quality
Abstract: Delaunay triangulation has been a staple of triangular mesh generation for a long time. Why? As well as being simple, fast, and visually pleasing, Delaunay triangulations can be shown to be optimal for various measures of mesh quality; for instance, they avoid sharp angles to the maximum extent possible. We will review these and other results on construction of meshes that optimize given quality measures, including recent work on postprocessing tetrahedral meshes to eliminate slivers.
TOPIC: Optimality and Guaranteed Quality
in Isoparametric Mesh Generation
Stephen Vavasis, Cornell University
Optimality and Guaranteed Quality in Isoparametric Mesh Generation. Isoparametric elements are the most widely used technique for accurate finite element analysis of curved geometries. Unstructured mesh generation of isoparametric elements from three-dimensional CAD geometry is a challenging problem because the CAD surfaces may have roughness, leading to uncertainty of how to place mesh nodes on the surface. In this presentation I will cover some quality guarantees that are desirable for isoparametric mesh generation. I will survey some of the approaches used in the previous literature. I will also propose new approaches to the problem with certain guaranteed properties.