Alper Ungor - University of Florida

Title: Mathematical Foundations of Mesh Generation

Abstract:
This lecture will review recent important results from Computational Geometry and Mesh Generation literature. The focus will be on provably-good meshing algorithms that have good performance in practice (matching the performance of best-known heuristics).

Mathematical foundations of mesh generation including simplicial and cubical complexes, Delaunay triangulations, Voronoi diagrams, minmax angle triangulations, sphere packings, lattices, local feature size, quality measures, time-complexity analysis (sequential and parallel), and mesh size optimality will be discussed in detail.

Biography:
Alper Ungor obtained his Ph.D. degree in Computer Science at the University of Illinois at Urbana-Champaign in 2002. After spending two years at Duke University as a Postdoctoral Research Associate, Alper joined the University of Florida where he is currently an Assistant Professor of Computer and Information Science and Engineering. Alper received the David Kuck Best Ph.D. Thesis Award (2002), the Dave and Jane Liu Award (2001), and the Excellence in Teaching Award (1997) at the University of Illinois. His research interests include the design and analysis of algorithms, computational geometry, mesh generation, scientific computing, and computational biology.

Mariette Yvinec - INRIA Research Center of Sophia-Antipolis

Title: Current trends in Delaunay refinement meshing

Abstract:
Delaunay refinement has long been recognized as a first choice tool for generation of unstructured simplicial meshes.
The course will focus on recent developments applying Delaunay refinement to the discretization of smooth or piecewise smooth curved surfaces and to the generation of three dimensional meshes for domains bounded by such surfaces.
The course will also describe how such methods have been implemented in the library CGAL and will introduce the resulting efficient, powerfull and flexible meshing tools offered by this library.

Biography:
Mariette Yvinec graduated from Ecole Normale Supérieure (ENS, Paris) and obtained a Phd thesis in solid state physics in 1983. She turned to computer science around 1985 and, slightly later, joined the Geometrica team at the INRIA research center of Sophia-Antipolis (France).Since then, she has published more than 50 journal and conference papers in the field of computational geometry and has taken an active part in the development of the Computational Geometry Algorithm Library CGAL. She is namely a specialist in the fields of triangulations, meshing and their applications to reconstruction. Mariette Yvinec belongs to the editorial board of the Journal of Discrete Algorithms and to the editorial board of CGAL.

IMR Home Page | Privacy and Security | Maintained by Jacqueline Finley