Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site watmath.UUCP
Path: utzoo!watmath!mwang
From: mwang@watmath.UUCP (mwang)
Newsgroups: ont.events
Subject: UW Num. Ana. Semi., Mr. Joe on "Finite Element Triangulation of Complex Regions Using Computational Geometry"
Message-ID: <6969@watmath.UUCP>
Date: Tue, 21-Feb-84 14:04:06 EST
Article-I.D.: watmath.6969
Posted: Tue Feb 21 14:04:06 1984
Date-Received: Wed, 22-Feb-84 02:06:14 EST
Expires: Tue, 28-Feb-84 00:00:00 EST
Organization: U of Waterloo, Ontario
Lines: 36


_D_E_P_A_R_T_M_E_N_T _O_F _C_O_M_P_U_T_E_R _S_C_I_E_N_C_E
_U_N_I_V_E_R_S_I_T_Y _O_F _W_A_T_E_R_L_O_O
_S_E_M_I_N_A_R _A_C_T_I_V_I_T_I_E_S

_N_U_M_E_R_I_C_A_L _A_N_A_L_Y_S_I_S _S_E_M_I_N_A_R
                           - Monday, February 27, 1984.

Barry Joe, a graduate student of this department,  will
speak  on ``Finite Element Triangulation of Complex Re-
gions Using Computational Geometry.''

TIME:                3:30 PM

ROOM:              MC 5158

ABSTRACT

Mesh generation is  an  important,  resource  consuming
part  of  finite element analysis and should be carried
out automatically as much as possible.  For  this  pur-
pose, we have implemented a method for producing a tri-
angulation of a complex polygonal region of the  plane.
Computational geometry techniques are used to decompose
the region into convex polygons and to triangulate  the
subregions  with triangles whose size distribution con-
forms to the boundary  edge  length  scales.   In  this
talk,  we  describe  algorithms for constructing an ap-
proximately equidistributing triangulation in  the  re-
gion and for constructing a Delaunay triangulation in a
convex polygon using a quasi-uniform grid.  Results are
presented  from  an experiment on a test region arising
in semiconductor device simulation.

                   February 21, 1984