The short courses will be held the day before the opening of the Conference. Courses will be taught by internationally known experts in the field of Mesh Generation. The courses will run an hour and a half 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 for 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.
Title: Surface Mesh Generation
Biography: Jean-François Remacle is an associate Professor at the Université catholique de Louvain in Belgium. He got his Ph.D. form the University of Liège (Belgium) in 1997. After a Post Doc at Ecole Polytechnique de Montréal (Canada), he joined the Scientific Computation Research Center (RPI/NY) in 1999, first as a research associate and then as research associate Professor. He joined the Université catholique de Louvain in 2002.
Pr. Remacle's research focuses on scientific computing. He is currently active in the development of high order discontinuous Galerkin methods with applications to CFD and ocean modeling. He is also working actively on mesh generation. Pr. Remacle is one of the two co-authors of Gmsh, the open source mesh generator http://www.geuz.org/gmsh). Pr. Remacle is an associate editor of SISC, the SIAM Journal on Scientific Computing.
Abstract: The course will be divided in two parts. The first part will be dedicated to surfaces. We will recall the basics of the topology and of the (differential) geometry of surfaces : genus, orientation, maps (conformal, equi-areal, harmonic) and charts, geometrical properties of surfaces (normals, curvatures). Some examples will be provided such as the study of
various parametrizations of of the sphere. We will then focus on a special class of surfaces that are described through a triangulation (discrete surfaces). We will show how to compute topological and geometrical properties of discrete surfaces and how to build discrete parametrizations of discrete surfaces.
The second part of the course will deal with surface mesh generation. We will develop the standard algorithms that enable to construct triangular meshes on surfaces : Delaunay, frontal, hybrid Delaunay and frontal. Here, we aim at being precise on the details of the implementation. The source code of Gmsh will serve as a demonstrator. Then, quadrilateral mesh generation techniques will be studied. Direct (Paving) and indirect (Q-Morph, Delquad) quadrilateralization methods will be explained and examples will illustrate the algorithms, as well as the source code of Gmsh. Some quad-mesh local and non-local optimization techniques will be explained and illustrated.
Title: Meshes in Computer Graphics
Biography: Bruno Levy directs the ALICE project team in INRIA Nancy Grand-Est and in the LORIA lab. His research topic is numerical geometry, with applications in numerical simulation, real-time rendering and scientific visualization. Some of his results (e.g., LSCM) are used in several commercial and open-source softwares. He defended his Ph.D. thesis in 1999 and received the Gilles Kahn /Académie des Sciences SPECIF national award in 2000. Then he did a post-doc in Stanford. He was program co-chair of ACM SPM in 2007 and 2008, program co-chair of ACM/EG SGP in 2010 and will be program co-chair of Pacific Graphic in 2012. He is associate editor of TVCG (IEEE) and Graphical Models (Elsevier). He was awarded a grant from the European Research Council in 2008, received the Lorraine regional young researcher award in 2010 and the INRIA national young researcher award in 2011.
Abstract: This course gives a short introduction to meshes used in Computer Graphics and the algorithms to generate them. After a short introduction to the notions of Voronoi diagram and Delaunay triangulation, the course reviews some reconstruction methods that generate a surface from a point set, and some re-meshing methods that improve the quality of an existing mesh. The course will also present some methods for meshing surface with quadrilaterals and volumes with hexahedra.
Title: Theoretically Guaranteed Delaunay Mesh Generation
Biography: Jonathan Shewchuk is an Associate Professor in the Department of Electrical Engineering and Computer Sciences at the University of California at Berkeley. He holds a B.Sc. in physics and computer science from Simon Fraser University, and a Ph.D. in computer science from Carnegie Mellon University. His publicly available mesh generator, Triangle, has tens of thousands of users and is the winner of the 2003 James Harady Wilkinson Prize in Numerical Software.
Abstract: This short course is an introduction to triangular and tetrahedral mesh generation algorithms based on Delaunay triangulations, with a twist. Coverage is restricted to algorithms that have two desirable qualities at once: they are mathematically guaranteed to generate high-quality meshes, and they work well enough in practice to compete with traditional, heuristic algorithms in engineering applications.
Topics covered include a short review of Delaunay triangulations and constrained Delaunay triangulations; extensive coverage of Delaunay refinement algorithms for triangular and tetrahedral mesh generation, including methods by Chew, Rupert, Ungor, Boivin/Ollivier-Gooch, Miller/Walkington/Pav, and me; handling of 2D domains with curved boundaries; handling of 2D and 3D domains with small angles; and sliver elimination.
Biography: Nikos Chrisochoides is the Richard T. Cheng Chair of Computer Science at Old Dominion University and John Simon Guggenheim Fellow in Medicine and Health. His research interests are in parallel mesh generation, medical image computing and parallel and distributed scientific computing. His research is application-driven. Currently he is working on real-time mesh generation for biomedical applications like non-rigid registration for Image Guided Neurosurgery. Chrisochoides received his B.Sc. in Mathematics from Aristotle University, Greece and his M.Sc. (in Mathematics) and Ph.D. (in Computer Science) degrees from Purdue University. Then he moved to Northeast Parallel Architectures Center (NPAC) at Syracuse University as the Alex Nason Postdoctoral Fellow in Computational Sciences. After NPAC he worked in the Advanced Computing Research Institute, at Cornell University. He joined (as an Assistant Professor in January 1997) the Department of Computer Science and Engineering at the University of Notre Dame. In the Fall of 2000, he moved to the College of William and Mary as an Associate Professor and in 2004 he was awarded the Alumni Memorial Distinghuised Professorship. Chrisochoides has more than 150 technical pulications in parallel scientific computing. He has held visting positions at Harvard Medical School (Spring 2005), MIT (Spring 2005), Brown (Fall 2004) and NASA/Langley (Summer 1994).
Biography: Andrey Chernikov graduated with a Ph.D. in Computer Science from the College of William and Mary in 2007. Prior to his Ph.D. work he obtained his M.S. and B.S. degrees in Applied Mathematics and Computer Science from the Kabardino-Balkar State University in Russia. After completing his Ph.D. work he was a Visiting Assistant Professor and a Postdoctoral Associate in Computer Science at William and Mary. Since the Fall of 2010 he has been working as a Research Assistant Professor and since the Spring of 2011 as an Assistant Professor in Computer Science at Old Dominion University. His research interests include image analysis in medical and bio-material modeling and simulation, quality mesh generation, high-performance scientific computing, and their applications.
Abstract: Parallel mesh generation is a relatively new research area transcending the boundaries of two scientific computing disciplines: computational geometry and parallel computing. In this tutorial we will present both the theoretical foundation and the practical aspects related to the implementation of parallel mesh generation methods on current and emerging architectures. Parallel mesh generation methods decompose the original mesh generation problem into smaller subproblems which are solved in parallel. We will organize the parallel mesh generation methods in terms of two basic attributes: (1) the sequential techniques used for meshing the individual subproblems and (2) the degree of coupling between the subproblems. We will briefly describe the well known sequential methods and identify common abstractions used in their parallelization.
The goals of the tutorial are: (1) to overview the existing parallel mesh generation methods and derive a general framework, (2) to apply this framework to the analysis and the parallelization of Delaunay based methods, and (3) to promote an off-line discussion about specific sequential methods from the audience. The target audience is: (1) graduate students from engineering, computer and applied sciences, (2) engineers from industry who are interested to re-train in parallel, real-time computing and mesh generation. The content level is 25% beginners, 50% intermediate, and 25% advanced. There are no pre-requisites, however the attendees are encouraged to bring their own methods for off-line discussion at the end of the tutorial.
The topics we will cover are: (1) introduction to widely used sequential mesh generation methods (general definitions and notation) and their classification into refinement-and tiling-based methods; (2) model decomposition using both domain-and data-centric methods; (3) parallel mesh generation methodology and classification into decoupled, partially-and tightly-coupled methods; (4) a case study using Delaunay-based methods; (5) parallel implementation and runtime software support systems for mesh generation methods; (6) parallel out-of-core techniques for very large size problems.