Unstructured Mesh Generation

[1]  Nigel P. Weatherill,et al.  Efficient three-dimensional grid generation using the Delaunay triangulation , 1992 .

[2]  Herbert Edelsbrunner,et al.  An Experimental Study of Sliver Exudation , 2002, Engineering with Computers.

[3]  V. T. Rajan.  Optimality of the Delaunay triangulation in ℝd , 1994, Discret. Comput. Geom..

[4]  F. Betul Atalay,et al.  Quadrilateral meshes with bounded minimum angle , 2009, SCG '09.

[5]  Tamal K. Dey,et al.  Anisotropic surface meshing , 2006, SODA '06.

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

[7]  N. Weatherill,et al.  Unstructured grid generation using iterative point insertion and local reconnection , 1995 .

[8]  David Eppstein,et al.  A ug 1 99 9 Quadrilateral Meshing by Circle Packing Marshall Bern , 2008 .

[9]  David Eppstein,et al.  Flipping Cubical Meshes , 2001, Engineering with Computers.

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

[11]  Steve Oudot,et al.  Provably good sampling and meshing of surfaces , 2005, Graph. Model..

[12]  James F. O'Brien,et al.  Dynamic local remeshing for elastoplastic simulation , 2010, SIGGRAPH 2010.

[13]  David Eppstein,et al.  Provably Good Mesh Generation , 1994, J. Comput. Syst. Sci..

[14]  Paresh Parikh,et al.  Generation of three-dimensional unstructured grids by the advancing-front method , 1988 .

[15]  J Peraire,et al.  Advancing Front Grid Generation , 1998 .

[16]  D. A. Field.  Qualitative measures for initial meshes , 2000 .

[17]  Jonathan Richard Shewchuk,et al.  Triangle: Engineering a 2D Quality Mesh Generator and Delaunay Triangulator , 1996, WACG.

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

[19]  Donald R. Chand,et al.  An Algorithm for Convex Polytopes , 1970, JACM.

[20]  Raimund Seidel,et al.  On the difficulty of triangulating three-dimensional Nonconvex Polyhedra , 1992, Discret. Comput. Geom..

[21]  M. Krízek,et al.  On the maximum angle condition for linear tetrahedral elements , 1992 .

[22]  Alper Üngör,et al.  Off-centers: A new type of Steiner points for computing size-optimal quality-guaranteed Delaunay triangulations , 2009, Comput. Geom..

[23]  Carol Hazlewood,et al.  Approximating constrained tetrahedrizations , 1993, Comput. Aided Geom. Des..

[24]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[25]  Jonathan Richard Shewchuk,et al.  What is a Good Linear Element? Interpolation, Conditioning, and Quality Measures , 2002, IMR.

[26]  David M. Mount,et al.  A point-placement strategy for conforming Delaunay tetrahedralization , 2000, SODA '00.

[27]  Jonathan Richard Shewchuk,et al.  Aggressive Tetrahedral Mesh Improvement , 2007, IMR.

[28]  Kokichi Sugihara,et al.  On good triangulations in three dimensions , 1992, Int. J. Comput. Geom. Appl..

[29]  R. Lohner,et al.  Improved adaptive refinement strategies for finite element aerodynamic computations , 1986 .

[30]  H. Si.  Constrained Delaunay tetrahedral mesh generation and refinement , 2010 .

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

[32]  Adrien Treuille,et al.  Modular bases for fluid dynamics , 2009, SIGGRAPH 2009.

[33]  D. T. Lee,et al.  Two algorithms for constructing a Delaunay triangulation , 1980, International Journal of Computer & Information Sciences.

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

[35]  Gary L. Miller,et al.  Sparse Voronoi Refinement , 2006, IMR.

[36]  C. O. Frederick,et al.  Two-dimensional automatic mesh generation for structural analysis (ijnme 2 (1970)) , 1970 .

[37]  Herbert Edelsbrunner,et al.  Sliver exudation , 2000, J. ACM.

[38]  David Eppstein,et al.  Tiling space and slabs with acute tetrahedra , 2003, Comput. Geom..

[39]  L. Paul Chew,et al.  Guaranteed-quality Delaunay meshing in 3D (short version) , 1997, SCG '97.

[40]  Barry Joe,et al.  Construction of Three-Dimensional Improved-Quality Triangulations Using Local Transformations , 1995, SIAM J. Sci. Comput..

[41]  Bharat K. Soni,et al.  Handbook of Grid Generation , 1998 .

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

[43]  B. Mourrain,et al.  Meshing of Surfaces , 2006 .

[44]  R. Courant,et al.  Über die partiellen Differenzengleichungen der mathematischen Physik , 1928 .

[45]  Nguyen-Van-Phai,et al.  Automatic mesh generation with tetrahedron elements , 1982 .

[46]  Gary L. Miller,et al.  When and why delaunay refinement algorithms work , 2005, Int. J. Comput. Geom. Appl..

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

[48]  Günter Rote,et al.  Incremental constructions con BRIO , 2003, SCG '03.

[49]  Jim Ruppert,et al.  A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation , 1995, J. Algorithms.

[50]  L. Paul Chew,et al.  Constrained Delaunay triangulations , 1987, SCG '87.

[51]  Laurent Rineau,et al.  Meshing 3D Domains Bounded by Piecewise Smooth Surfaces* , 2007, IMR.

[52]  Tamal K. Dey,et al.  Quality meshing for polyhedra with small angles , 2004, SCG '04.

[53]  S. Waldron.  The Error in Linear Interpolation at the Vertices of a Simplex , 1998 .

[54]  Ralf Diekmann,et al.  Improved Mesh Generation: Not Simple but Good , 2006 .

[55]  Rex A. Dwyer.  Higher-dimensional voronoi diagrams in linear expected time , 1991, Discret. Comput. Geom..

[56]  Robert Schneiders.  Quadrilateral and Hexahedral Element Meshes , 2002 .

[57]  N. Weatherill.  Delaunay triangulation in computational fluid dynamics , 1992 .

[58]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[59]  Joe F. Thompson.  The National Grid Project , 1992 .

[60]  M. Yvinec,et al.  Variational tetrahedral meshing , 2005, SIGGRAPH 2005.

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

[62]  Paul-Louis George,et al.  Optimization of Tetrahedral Meshes , 1995 .

[63]  François Labelle.  Sliver Removal by Lattice Refinement , 2008, Int. J. Comput. Geom. Appl..

[64]  Paul-Louis George,et al.  Delaunay triangulation and meshing : application to finite elements , 1998 .

[65]  C.R.E. de Oliveira,et al.  Tetrahedral mesh optimisation and adaptivity for steady-state and transient finite element calculations , 2001 .

[66]  L. R. Scott,et al.  On the conditioning of finite element equations with highly refined meshes , 1989 .

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

[68]  Gary L. Miller,et al.  When and Why Ruppert's Algorithm Works , 2003, IMR.

[69]  Jonathan Richard Shewchuk,et al.  General-Dimensional Constrained Delaunay and Constrained Regular Triangulations, I: Combinatorial Properties , 2008, Discret. Comput. Geom..

[70]  Herbert Edelsbrunner,et al.  Sliver exudation , 1999, SCG '99.

[71]  Noel Walkington,et al.  Delaunay Refinement by Corner Lopping , 2005, IMR.

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

[73]  Edward A. Sadek,et al.  A scheme for the automatic generation of triangular finite elements , 1980 .

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

[75]  C. Lawson.  Software for C1 Surface Interpolation , 1977 .

[76]  J. Shewchuk,et al.  Isosurface stuffing: fast tetrahedral meshes with good dihedral angles , 2007, SIGGRAPH 2007.

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

[78]  Ted D. Blacker,et al.  Paving: A new approach to automated quadrilateral mesh generation , 1991 .

[79]  Jonathan Richard Shewchuk,et al.  Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation , 2003, SCG '03.

[80]  Paul Kinney.  “CleanUp: Improving Quadrilateral Finite Element Meshes” , 2008 .

[81]  Alper Üngör,et al.  Triangulations with locally optimal Steiner points , 2007, Symposium on Geometry Processing.

[82]  Matthew L. Staten,et al.  Unconstrained Paving and Plastering: Progress Update , 2006, IMR.

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

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

[85]  O. C. Zienkiewicz,et al.  Adaptive remeshing for compressible flow computations , 1987 .

[86]  W. C. Rheinboldt,et al.  The hypercircle in mathematical physics , 1958 .

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

[88]  David Eppstein,et al.  MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .

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

[90]  Mark T. Jones,et al.  An efficient parallel algorithm for mesh smoothing , 1995 .

[91]  Marc Vigo Anglada,et al.  An improved incremental algorithm for constructing restricted delaunay triangulations , 1997, Comput. Graph..

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

[93]  LongChen,et al.  OPTIMAL DELAUNAY TRIANGULATIONS , 2004 .

[94]  J. D. Bernal,et al.  Random close-packed hard-sphere model. II. Geometry of random packing of hard spheres , 1967 .

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

[96]  J. A. George.  Computer implementation of the finite element method , 1971 .

[97]  P. George,et al.  Automatic mesh generator with specified boundary , 1991 .

[98]  Alexander Rand,et al.  Collars and Intestines: Practical Conforming Delaunay Refinement , 2009, IMR.

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

[100]  E. Schönhardt,et al.  Über die Zerlegung von Dreieckspolyedern in Tetraeder , 1928 .

[101]  Charles Boivin,et al.  Guaranteed‐quality triangular mesh generation for domains with curved boundaries , 2002 .

[102]  Rex A. Dwyer.  A faster divide-and-conquer algorithm for constructing delaunay triangulations , 1987, Algorithmica.

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

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

[105]  Carl Ollivier-Gooch,et al.  Tetrahedral mesh improvement using swapping and smoothing , 1997 .

[106]  D. Mavriplis.  An advancing front Delaunay triangulation algorithm designed for robustness , 1993 .

[107]  Jonathan Richard Shewchuk,et al.  Tetrahedral mesh generation by Delaunay refinement , 1998, SCG '98.

[108]  F. Hermeline,et al.  Triangulation automatique d'un polyèdre en dimension $N$ , 1982 .

[109]  Jonathan Richard Shewchuk,et al.  Updating and constructing constrained delaunay and constrained regular triangulations by flips , 2003, SCG '03.

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

[111]  Gary L. Miller,et al.  A bézier-based approach to unstructured moving meshes , 2004, SCG '04.

[112]  Joshua A. Levine,et al.  A Practical Delaunay Meshing Algorithm for aLarge Class of Domains* , 2007, IMR.

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

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

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