Skip to main content
Article thumbnail
Location of Repository

Reviewed by Luiz Henrique de Figueiredo References

By Mr (f: D (n and Hang (d-wias

Abstract

Adaptive tetrahedral mesh generation by constrained Delaunay refinement. (English summary) Internat. J. Numer. Methods Engrg. 75 (2008), no. 7, 856–880.1097-0207 The paper presents a mesh generation algorithm that generates an isotropic tetrahedral mesh respecting a sizing function that can be provided by the user or derived automatically from error analysis in the finite element method. The algorithm refines an initial constrained Delaunay mesh by inserting points according to the sizing function and the Delaunay refinement rules. The authors give theoretical guarantees that the generated meshes have good quality tetrahedra and graded mesh size for a large class of mesh domains. They also discuss techniques for the removal of remaining slivers

Year: 2013
OAI identifier: oai:CiteSeerX.psu:10.1.1.352.6344
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.