10:30 AM-12:30 PM
Building 200, Room 2
Generating a good mesh is fundamental to the numerical solution of partial differential equations. Many geometric subproblems arise when designing mesh generation algorithms. For example, most numerical methods require well-shaped mesh elements, which must be guaranteed either by the initial construction of the mesh or by mesh smoothing. Geometrically complex domains can cause topological and combinatorial difficulties for mesh generation algorithms. The conflicting goals of solution accuracy and computational efficiency can be addressed by varying element size over the solution domain. This minisymposium surveys recent research that provides rigorous solutions to various of these subproblems; a common theme is the use of techniques from computational geometry.
The minisymposium addresses rigorous algorithmic approaches to some of the geometric subproblems that arise in mesh generation. This minisymposium will give a snapshot of recent research at the boundary between computational geometry and mesh generation. The intended audience is researchers in both fields, as well as users of mesh generation tools interested in current research directions.
Organizers: Steven J. Fortune, Bell Laboratories, Lucent Technologies; and Marshall W. Bern, Xerox PARC
AN97 Homepage | Program Updates|
Registration | Hotel and Dormitory Information | Transportation | Program-at-a-Glance | Program Overview