matlab2015年中南大学地球科学与信息学院第5课课件test.pdfVIP

Delaunay Refinement Algorithms for Triangular Mesh Generation Jonathan Richard Shewchuk jrs@ May 21, 2001 Department of Electrical Engineering and Computer Science University of California at Berkeley Berkeley, CA 94720 Supported in part by the National Science Foundation under Awards ACI-9875170, CMS-9980063, CMS-9318163, and EIA- 9802069, in part by the Advanced Research Projects Agency and Rome Laboratory, Air Force Materiel Command, USAF under agreement number F30602-96-1-0287, in part by the Natural Sciences and Engineering Research Council of Canada under a 1967 Science and Engineering Scholarship, and in part by gifts from the Okawa Foundation and Intel. The views and conclusions contained in this document are those of the author. They are not endorsed by, and do not necessarily reflect the position or policies of, the U. S. Government or other sponsors. Abstract Delaunay refinement is a technique for generating unstructured meshes of triangles for use in interpolation, the finite element method, and the finite volume method. In theory and practice, meshes produced by Delaunay refinement satisfy guaranteed bounds on angles, edge lengths, the number of triangles, and the grading of triangles from small to large sizes. This article presents an intuitive framework for analyzing Delaunay refinement algorithms that unifies the pioneering mesh generation algorithms of L. Paul Chew and Jim Ruppert, improves the algorithms in several minor ways, and most importantly, helps to solve the difficult problem of meshing nonmanif