Node placement for triangular mesh generation by Monte Carlo simulation

A new approach of node placement for unstructured mesh generation is proposed. It is based on the Monte Carlo method to position nodes for triangular or tetrahedral meshes. Surface or volume geometries to be meshed are treated as atomic systems, and mesh nodes are considered as interacting particles. By minimizing system potential energy with Monte Carlo simulation, particles are placed into a near-optimal configuration. Well-shaped triangles or tetrahedra can then be created after connecting the nodes by constrained Delaunay triangulation or tetrahedrization. The algorithm is simple, easy to implement, and works in an almost identical way for 2D and 3D meshing. Copyright © 2005 John Wiley & Sons, Ltd.

[1]  Dafna Talmor,et al.  Well-Spaced Points for Numerical Methods , 1997 .

[2]  Per-Olof Persson,et al.  A Simple Mesh Generator in MATLAB , 2004, SIAM Rev..

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

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

[5]  J. Banavar,et al.  Computer Simulation of Liquids , 1988 .

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

[7]  Roger I. Tanner,et al.  Generation of unstructured tetrahedral meshes by advancing front technique , 1993 .

[8]  N. Weatherill,et al.  Efficient three‐dimensional Delaunay triangulation with automatic point creation and imposed boundary constraints , 1994 .

[9]  Chjan C. Lim,et al.  Monte-Carlo and polyhedron-based simulations I: extremal states of the logarithmic N-body problem on a sphere , 2003 .

[10]  Shang-Hua Teng,et al.  Sliver-free three dimensional delaunay mesh generation , 2001 .

[11]  J. Peiro,et al.  Adaptive remeshing for three-dimensional compressible flow computations , 1992 .

[12]  Alexei M. Khokhlov,et al.  Fully Threaded Tree Algorithms for Adaptive Refinement Fluid Dynamics Simulations , 1997, astro-ph/9701194.

[13]  Jonathan Richard Shewchuk,et al.  Delaunay refinement algorithms for triangular mesh generation , 2002, Comput. Geom..

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

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

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

[17]  S. Lo.  Volume discretization into tetrahedra—II. 3D triangulation by advancing front approach , 1991 .

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

[19]  Kenji Shimada,et al.  Bubble mesh: automated triangular meshing of non-manifold geometry by sphere packing , 1995, SMA '95.