Approximate Quality Mesh Generation Based on Small Edge Details
Simpson, Bruce, Nancy Hitschfeld and Maria-Cecilia Rivara
Proceedings, 9th International Meshing Roundtable, Sandia National Laboratories, pp.411-421, October 2000
9th International Meshing Roundtable
October 2-5, 2000, New Orleans, Louisiana USA
The more general technique is an algorithm reorganization to avoid maintaining a global list of triangles to be refined. The reorganization uses a recursive strategy based on: (1) the identification of the small edges in the input PSLG (planar straight line graph) describing the geometry; and (2) a recursive triangle improvement procedure around these small edges. ëftuncating the recursion depth results in an approximate method.
The second technique is an extension of the first which uses specific properties of the terminal-edge LEPP-Delaunay refinement method to further simplify the refinement algorithm. These properties are established in the paper. Comparisons of approximate to full quality meshes axe provided.
Download Full Paper (Postscript Format)
Contact author(s) or publisher for availability and copyright information on above referenced article