On good triangulations in three dimensions

Triangulation of a point set or a polyhedron is an important problem with applicationsfor finite element simulations in CAD/CAM. Though a number of algorithms exist fortriangulating a point set or a polyhedron in two and three dimensions [6, 1, 10, 12], fewof them address the problem of guaranteeing the shape of the triangular elements, theygenerate. To reduce ill-conditioningas well as discretization error, finite element methodsrequire triangular meshes of bounded aspect ratio [2, 11]. By aspect ratio of triangles ortetrahedra, one may consider the ratio of the radii of the circumscribing circle to that ofinscribing circle (spheres in case oftetrahedra).

[1]  Bernard Chazelle,et al.  Triangulating a non-convex polytype , 1989, SCG '89.

[2]  Tamal K. Dey.  Good Triangulations in Plane , 1990 .

[3]  David Avis,et al.  Triangulating simplicial point sets in space , 1986, SCG '86.

[4]  Herbert Edelsbrunner,et al.  Tetrahedrizing Point Sets in Three Dimensions , 1988, ISSAC.

[5]  D. T. Lee,et al.  Generalized delaunay triangulation for planar graphs , 1986, Discret. Comput. Geom..

[6]  B. Joe.  Three-dimensional triangulations from local transformations , 1989 .

[7]  David Eppstein,et al.  Provably good mesh generation , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[8]  Tamal K. Dey,et al.  Triangulation and CSG representation of polyhedra with arbitrary genus , 1991, SCG '91.

[9]  I. Fried.  Condition of finite element matrices generated from nonuniform meshes. , 1972 .

[10]  L. Paul Chew,et al.  Guaranteed-Quality Triangular Meshes , 1989 .

[11]  D. F. Watson.  Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[12]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[13]  I. Babuska,et al.  ON THE ANGLE CONDITION IN THE FINITE ELEMENT METHOD , 1976 .

[14]  Edelsbrunner Herbert.  Spatial Triangulations with Dihedral Angle Conditions , 1989 .

[15]  Brenda S. Baker,et al.  Nonobtuse triangulation of polygons , 1988, Discret. Comput. Geom..

[16]  RICHARD BEALS.  I. Introduction , 1973 .