MESH GENERATION AND OPTIMAL TRIANGULATION

We survey the computational geometry relevant to nite element mesh generation. We especially focus on optimal triangulations of geometric domains in two-and three-dimensions. An optimal triangulation is a partition of the domain into triangles or tetrahedra, that is best according to some criterion that measures the size, shape, or number of triangles. We discuss algorithms both for the optimization of triangulations on a xed set of vertices and for the placement of new vertices (Steiner points). We brieey survey the heuristic algorithms used in some practical mesh generators.

[1]  Bernard Chazelle,et al.  Bounds on the size of tetrahedralizations , 1994, SCG '94.

[2]  Tiow Seng Tan,et al.  An optimal bound for conforming quality triangulations: (extended abstract) , 1994, SCG '94.

[3]  Herbert Edelsbrunner,et al.  Triangulating topological spaces , 1994, SCG '94.

[4]  Emo Welzl,et al.  Fast greedy triangulation algorithms , 1994, SCG '94.

[5]  Marshall W. Bern,et al.  Linear-size nonobtuse triangulation of polygons , 1994, SCG '94.

[6]  Micha Sharir,et al.  Piecewise-linear interpolation between polygonal slices , 1994, SCG '94.

[7]  Mark T. Jones,et al.  Parallel algorithms for the adaptive refinement and partitioning of unstructured meshes , 1994, Proceedings of IEEE Scalable High Performance Computing Conference.

[8]  Bernd Hamann,et al.  A data reduction scheme for triangulated surfaces , 1994, Comput. Aided Geom. Des..

[9]  Ketan Mulmuley,et al.  Computational geometry - an introduction through randomized algorithms , 1993 .

[10]  David Eppstein,et al.  Edge insertion for optimal triangulations , 1993, Discret. Comput. Geom..

[11]  Scott A. Mitchell,et al.  Refining a triangulation of a planar straight-line graph to eliminate large angles , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[12]  Derek G. Corneil,et al.  Polynomial-time Instances of the Minimum Weight Triangulation Problem , 1993, Comput. Geom..

[13]  Mary-Anne K. Posenau.  Approaches to High Aspect Ratio Triangulations , 1993, CCCG.

[14]  Jens-Dominik Mueller,et al.  Proven angular bounds and stretched triangulations with the frontal Delaunay method , 1993 .

[15]  Michael B. Dillencourt,et al.  A Simple Method for Resolving Degeneracies in Delaunay Triangulations , 1993, ICALP.

[16]  Marshall W. Bern,et al.  Compatible tetrahedralizations , 1993, SCG '93.

[17]  L. Paul Chew,et al.  Guaranteed-quality mesh generation for curved surfaces , 1993, SCG '93.

[18]  Andrzej Lingas,et al.  A linear-time randomized algorithm for the bounded Voronoi diagram of a simple polygon , 1993, SCG '93.

[19]  María Cecilia Rivara.  A Discussion on the Triangulation Refinement Problem , 1993, CCCG.

[20]  Jean-Claude Spehner,et al.  On Equiangularity of Delaunay Diagrams in Every Dimension , 1993, CCCG.

[21]  Jim Ruppert,et al.  A new and simple algorithm for quality 2-dimensional mesh generation , 1993, SODA '93.

[22]  R. Seidel.  Backwards Analysis of Randomized Geometric Algorithms , 1993 .

[23]  Godfried T. Toussaint,et al.  Tetrahedralization of Simple and Non-Simple Polyhedra , 1993, CCCG.

[24]  Klaus Jansen.  One Strike Against the Min-max Degree Triangulation Problem , 1992, Comput. Geom..

[25]  Carl Gutwin,et al.  Classes of graphs which approximate the complete euclidean graph , 1992, Discret. Comput. Geom..

[26]  David A. Field.  Delaunay criteria for triangulating surfaces , 1992 .

[27]  Lori L. Scarlatos,et al.  Optimizing triangulations by curvature equalization , 1992, Proceedings Visualization '92.

[28]  L. Nackman,et al.  Automatic mesh generation using the symmetric axis transformation of polygonal domains , 1992, Proc. IEEE.

[29]  David Eppstein,et al.  Approximating the minimum weight triangulation , 1992, SODA '92.

[30]  John R. Gilbert,et al.  Drawing the Planar Dual , 1992, Inf. Process. Lett..

[31]  Mary-Anne K. Posenau,et al.  Delaunay triangulation and computational fluid dynamics meshes , 1992 .

[32]  J. Hershberger,et al.  Convex Polygons Made from Few Lines and Convex Decompositions of Polyhedra , 1992, SWAT.

[33]  Wolfgang Fichtner,et al.  Automatic rectangle-based adaptive mesh generation without obtuse angles , 1992, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[34]  Elefterios A. Melissaratos,et al.  Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes , 1992, SCG '92.

[35]  David Eppstein,et al.  Triangulating polygons without large angles , 1992, SCG '92.

[36]  Herbert Edelsbrunner,et al.  Incremental topological flipping works for regular triangulations , 1992, SCG '92.

[37]  Scott A. Mitchell,et al.  Quality mesh generation in three dimensions , 1992, SCG '92.

[38]  Tiow Seng Tan,et al.  An upper bound for conforming Delaunay triangulations , 1992, SCG '92.

[39]  M. Rivara,et al.  A 3-D refinement algorithm suitable for adaptive and multi-grid techniques , 1992 .

[40]  Andrzej Lingas,et al.  Fast Algorithms for Greedy Triangulation , 1990, SWAT.

[41]  J. Matousek.  Reporting Points in Halfspaces , 1992, Comput. Geom..

[42]  David Eppstein.  The Farthest Point Delaunay Triangulation Minimizes Angles , 1991, Comput. Geom..

[43]  Nickolas S. Sapidis,et al.  Delaunay triangulation of arbitrarily shaped planar domains , 1991, Comput. Aided Geom. Des..

[44]  Tiow Seng Tan,et al.  A quadratic time algorithm for the minmax length triangulation , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[45]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[46]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[47]  Andrzej Lingas,et al.  On Computing the Voronoi Diagram for Restricted Planar Figures , 1991, WADS.

[48]  Timothy Baker,et al.  Unstructured meshes and surface fidelity for complex shapes , 1991 .

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

[50]  V. T. Rajan,et al.  Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.

[51]  David Eppstein,et al.  Polynomial-size nonobtuse triangulation of polygons , 1991, SCG '91.

[52]  William H. Frey,et al.  Mesh relaxation: A new technique for improving triangulations , 1991 .

[53]  Barry Joe,et al.  Construction of three-dimensional Delaunay triangulations using local transformations , 1991, Comput. Aided Geom. Des..

[54]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1991, SMA '91.

[55]  Barry Joe,et al.  Delaunay versus max‐min solid angle triangulations for three‐dimensional mesh generation , 1991 .

[56]  S. H. Lo,et al.  Automatic mesh generation and adaptation by using contours , 1991 .

[57]  Warren D. Smith,et al.  GRADED TETRAHEDRAL FINITE ELEMENT MESHES , 1991 .

[58]  Kenneth L. Clarkson,et al.  Approximation algorithms for planar traveling salesman tours and minimum-length triangulations , 1991, SODA '91.

[59]  David Eppstein,et al.  The expected extremes in a Delaunay triangulation , 1991, Int. J. Comput. Geom. Appl..

[60]  Mihalis Yannakakis,et al.  Simple Local Search Problems That are Hard to Solve , 1991, SIAM J. Comput..

[61]  Dimitri J. Mavriplis,et al.  Unstructured and adaptive mesh generation for high Reynolds number viscous flows , 1991 .

[62]  J. Castillo.  Mathematical Aspects of Numerical Grid Generation , 1991, Frontiers in Applied Mathematics.

[63]  Simon Kasif,et al.  Learning with a Helpful Teacher , 1991, IJCAI.

[64]  Roy Williams,et al.  Adaptive Parallel Meshes with Complex Geometry , 1991 .

[65]  Bernard Chazelle,et al.  Triangulating a simple polygon in linear time , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[66]  Paul-Louis George,et al.  Fully automatic mesh generator for 3D domains of any shape , 1990, IMPACT Comput. Sci. Eng..

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

[68]  David P. Dobkin,et al.  Contour tracing by piecewise linear approximations , 1990, TOGS.

[69]  Samuel Rippa,et al.  Minimal roughness property of the Delaunay triangulation , 1990, Comput. Aided Geom. Des..

[70]  Robert J. Renka,et al.  A constrained two-dimensional triangulation and the solution of closest node problems in the presence of barriers , 1990 .

[71]  Dianne Hansford.  The neutral case for the min-max triangulation , 1990, Comput. Aided Geom. Des..

[72]  Gary L. Miller,et al.  Separators in two and three dimensions , 1990, STOC '90.

[73]  S. Rippa,et al.  Data Dependent Triangulations for Piecewise Linear Interpolation , 1990 .

[74]  Barry Joe,et al.  On the correctness of a linear-time visibility polygon algorithm , 1990 .

[75]  Joe Warren,et al.  Adaptive mesh generation I: Packing space , 1990 .

[76]  E. K. Buratynski.  A fully automatic three-dimensional mesh generator for complex geometries , 1990 .

[77]  Larry L. Schumaker,et al.  Reconstructing 3D Objects from Cross-Sections , 1990 .

[78]  Bernard Chazelle,et al.  Triangulating a nonconvex polytope , 1990, Discret. Comput. Geom..

[79]  Leonidas J. Guibas,et al.  A linear-time algorithm for computing the voronoi diagram of a convex polygon , 1989, Discret. Comput. Geom..

[80]  S. H. Lo,et al.  Delaunay triangulation of non‐convex planar domains , 1989 .

[81]  Mukul Saxena,et al.  Automatic mesh generation from solid models based on recursive spatial decompositions , 1989 .

[82]  R. B. Simpson,et al.  On optimal interpolation triangle incidences , 1989 .

[83]  Subhash Suri,et al.  Fast matching algorithms for points on a polygon , 1989, 30th Annual Symposium on Foundations of Computer Science.

[84]  Paul Chew,et al.  There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..

[85]  Carl Gutwin,et al.  The Delauney Triangulation Closely Approximates the Complete Euclidean Graph , 1989, WADS.

[86]  Hanan Samet,et al.  The Design and Analysis of Spatial Data Structures , 1989 .

[87]  T. J. Baker,et al.  Developments and trends in three-dimensional mesh generation , 1989 .

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

[89]  Herbert Edelsbrunner,et al.  An acyclicity theorem for cell complexes in d dimensions , 1989, SCG '89.

[90]  Rex A. Dwyer.  Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.

[91]  Nickolas S. Sapidis,et al.  Advanced techniques for automatic finite element meshing from solid models , 1989 .

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

[93]  L. Paul Chew.  Constrained delaunay triangulations , 1989 .

[94]  Timothy J. Barth,et al.  The design and application of upwind schemes on unstructured meshes , 1989 .

[95]  János Pach,et al.  Cell decomposition of polytopes by bending , 1988 .

[96]  Graham F. Carey,et al.  A class of data structures for 2‐D and 3‐D adaptive mesh refinement , 1988 .

[97]  Stephan Olariu,et al.  On a Conjecture by Plaisted and Hong , 1988, J. Algorithms.

[98]  M. Shephard,et al.  Geometry-based fully automatic mesh generation and the delaunay triangulation , 1988 .

[99]  D. A. Field.  Laplacian smoothing and Delaunay triangulations , 1988 .

[100]  Jules Bloomenthal,et al.  Polygonization of implicit surfaces , 1988, Comput. Aided Geom. Des..

[101]  O. Zienkiewicz,et al.  Finite element Euler computations in three dimensions , 1988 .

[102]  Jean-Daniel Boissonnat,et al.  Shape reconstruction from planar cross sections , 1988, Comput. Vis. Graph. Image Process..

[103]  H. Edelsbrunner,et al.  Tetrahedrizing Point Sets in Three Dimensions , 1988, ISSAC.

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

[105]  Olivier D. Faugeras,et al.  Representing stereo data with the Delaunay triangulation , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[106]  Mark S. Shephard,et al.  Approaches to the Automatic Generation and Control of Finite Element Meshes , 1988 .

[107]  K. Ho-Le,et al.  Finite element mesh generation methods: a review and classification , 1988 .

[108]  Robert E. Tarjan,et al.  An O(n log log n)-Time Algorithm for Triangulating a Simple Polygon , 1988, SIAM J. Comput..

[109]  David M. Mount,et al.  Globally-Equiangular triangulations of co-circular points in 0(n log n) time , 1988, SCG '88.

[110]  David Avis,et al.  Triangulating point sets in space , 1987, Discret. Comput. Geom..

[111]  W. Frey.  Selective refinement: A new strategy for automatic node placement in graded triangular meshes , 1987 .

[112]  David P. Dobkin,et al.  Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[113]  B. Joe,et al.  Corrections to Lee's visibility polygon algorithm , 1987, BIT.

[114]  Lenhart K. Schubert,et al.  An optimal algorithm for constructing the Delaunay triangulation of a set of line segments , 1987, SCG '87.

[115]  Rainald Löhner,et al.  Finite elements in CFD: What lies ahead , 1987 .

[116]  David A. Plaisted,et al.  A Heuristic Triangulation Algorithm , 1987, J. Algorithms.

[117]  K. R. Grice,et al.  Robust, geometrically based, automatic two‐dimensional mesh generation , 1987 .

[118]  Larry L. Schumaker,et al.  Triangulation Methods , 1987, Topics in Multivariate Approximation.

[119]  Herbert Edelsbrunner,et al.  Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.

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

[121]  Robert E. Tarjan,et al.  Rotation distance, triangulations, and hyperbolic geometry , 1986, STOC '86.

[122]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[123]  D. A. Field,et al.  Implementing Watson's algorithm in three dimensions , 1986, SCG '86.

[124]  R. B. Simpson,et al.  Triangular meshes for regions of complicated shape , 1986 .

[125]  B. Joe.  Delaunay Triangular Meshes in Convex Polygons , 1986 .

[126]  A Jameson,et al.  CALCULATION OF IN VISCID TRANSONIC FLOW OVER A COMPLETE AIRCRAFT , 1986 .

[127]  Leila De Floriani,et al.  Delaunay-based representation of surfaces defined over arbitrarily shaped domains , 1985, Comput. Vis. Graph. Image Process..

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

[129]  S. Lo.  A NEW MESH GENERATION SCHEME FOR ARBITRARY PLANAR DOMAINS , 1985 .

[130]  William H. Frey,et al.  An apporach to automatic three‐dimensional finite element mesh generation , 1985 .

[131]  Norishige Chiba,et al.  Arboricity and Subgraph Listing Algorithms , 1985, SIAM J. Comput..

[132]  Joe F. Thompson,et al.  Numerical grid generation: Foundations and applications , 1985 .

[133]  Mark S. Shephard,et al.  Automatic three-dimensional mesh generation by the finite octree technique , 1984 .

[134]  Bernard Chazelle,et al.  Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm , 1984, SIAM J. Comput..

[135]  Arne Maus,et al.  Delaunay triangulation and the convex hull ofn points in expected linear time , 1984, BIT.

[136]  Hanan Samet,et al.  The Quadtree and Related Hierarchical Data Structures , 1984, CSUR.

[137]  M. Rivara.  Algorithms for refining triangular grids suitable for adaptive and multigrid techniques , 1984 .

[138]  Bernard Chazelle,et al.  Triangulation and shape-complexity , 1984, TOGS.

[139]  R. E. Barnhill,et al.  Computer-aided surface representation and design , 1984 .

[140]  D. Lindholm,et al.  Automatic triangular mesh generation on surfaces of polyhedra , 1983 .

[141]  A. Bykat,et al.  Design of a recursive, shape controlling mesh generator , 1983 .

[142]  Kurt Mehlhorn,et al.  Fast Triangulation of Simple Polygons , 1983, FCT.

[143]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[144]  D. T. Lee,et al.  Visibility of a simple polygon , 1983, Comput. Vis. Graph. Image Process..

[145]  D. F. Watson,et al.  Systematic triangulations , 1983, Comput. Vis. Graph. Image Process..

[146]  Mark Yerry,et al.  A Modified Quadtree Approach To Finite Element Mesh Generation , 1983, IEEE Computer Graphics and Applications.

[147]  Frances F. Yao,et al.  Speed-Up in Dynamic Programming , 1982 .

[148]  R. Seidel.  A Convex Hull Algorithm Optimal for Point Sets in Even Dimensions , 1981 .

[149]  David Avis,et al.  A Linear Algorithm for Computing the Visibility Polygon from a Point , 1981, J. Algorithms.

[150]  Adrian Bowyer,et al.  Computing Dirichlet Tessellations , 1981, Comput. J..

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

[152]  W. C. Thacker,et al.  A brief review of techniques for generating irregular computational grids , 1980 .

[153]  David G. Kirkpatrick,et al.  A Note on Delaunay and Optimal Triangulations , 1980, Inf. Process. Lett..

[154]  G. Klincsek.  Minimal Triangulations of Polygonal Domains , 1980 .

[155]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..

[156]  Glenn K. Manacher,et al.  Neither the Greedy Nor the Delaunay Triangulation of a Planar Point Set Approximates the Optimal Triangulation , 1979, Inf. Process. Lett..

[157]  Peter Gilbert.  New Results on Planar Triangulations. , 1979 .

[158]  Robert E. Tarjan,et al.  Triangulating a Simple Polygon , 1978, Inf. Process. Lett..

[159]  Der-Tsai Lee.  Proximity and reachability in the plane. , 1978 .

[160]  Robin Sibson,et al.  Locally Equiangular Triangulations , 1978, Comput. J..

[161]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[162]  D. Rose,et al.  Generalized nested dissection , 1977 .

[163]  Errol L. Lloyd.  On triangulations of a set of points in the plane , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[164]  C. Lawson.  Software for C1 interpolation , 1977 .

[165]  C. M. Gold,et al.  Automated contour mapping using triangular element data structures and an interpolant over each irregular triangular domain , 1977, SIGGRAPH '77.

[166]  Robert E. Barnhill,et al.  Representation and Approximation of Surfaces , 1977 .

[167]  L. Herrmann.  Laplacian-Isoparametric Grid Generation Scheme , 1976 .

[168]  P. Jamet.  Estimations d'erreur pour des éléments finis droits presque dégénérés , 1976 .

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

[170]  Michael Ian Shamos,et al.  Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[171]  F. Stenger,et al.  A lower bound on the angles of triangles constructed by bisecting the longest side , 1975 .

[172]  Ja Gregory,et al.  Error bounds for linear interpolation on triangles , 1975 .

[173]  J. Cavendish.  Automatic triangulation of arbitrary planar domains for the finite element method , 1974 .

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

[175]  T. C. Hu,et al.  Optimal Computer Search Trees and Variable-Length Alphabetical Codes , 1971 .

[176]  R. E. Miles.  On the homogeneous planar Poisson point process , 1970 .

[177]  J. F. Randolph.  Calculus and analytic geometry , 1965 .

[178]  A. M. Winslow.  AN IRREGULAR TRIANGLE MESH GENERATOR , 1964 .

[179]  N. J. Lennes.  Theorems on the Simple Finite Polygon and Polyhedron , 1911 .