We describe a new algorithm called CRDT for computing conformal mappings of polygons (Schwarz-Christoffel transformations). The method is based on a Delaunay triangulation of the polygon and on crossratios of quadrilaterals in the triangulation. Unlike previous algorithms for computing conformal mappings, CRDT can accurately solve for the conformal map even when the polygon contains arbitrary elongated channels.

CRDT can be used to generate globally structured meshes for 2D regions in which grid lines meet at perfect right angles. We present computational experiments with CRDT mesh generation. This talk represents joint work with T. Driscoll.

Back to Workshop Schedule

1996-1997 Mathematics in High Performance Computing