Mesh generation for implicit geometries

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.

Bibliographic Details
Main Author: Persson, Per-Olof, 1973-
Other Authors: Alan Edelman and Gilbert Strang.
Format: Thesis
Language:eng
Published: Massachusetts Institute of Technology 2008
Subjects:
Online Access:http://dspace.mit.edu/handle/1721.1/27866
http://hdl.handle.net/1721.1/27866
_version_ 1826188955260813312
author Persson, Per-Olof, 1973-
author2 Alan Edelman and Gilbert Strang.
author_facet Alan Edelman and Gilbert Strang.
Persson, Per-Olof, 1973-
author_sort Persson, Per-Olof, 1973-
collection MIT
description Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.
first_indexed 2024-09-23T08:07:35Z
format Thesis
id mit-1721.1/27866
institution Massachusetts Institute of Technology
language eng
last_indexed 2024-09-23T08:07:35Z
publishDate 2008
publisher Massachusetts Institute of Technology
record_format dspace
spelling mit-1721.1/278662022-01-13T07:54:35Z Mesh generation for implicit geometries Persson, Per-Olof, 1973- Alan Edelman and Gilbert Strang. Massachusetts Institute of Technology. Dept. of Mathematics. Massachusetts Institute of Technology. Department of Mathematics Mathematics. Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005. Includes bibliographical references (p. 119-126). We present new techniques for generation of unstructured meshes for geometries specified by implicit functions. An initial mesh is iteratively improved by solving for a force equilibrium in the element edges, and the boundary nodes are projected using the implicit geometry definition. Our algorithm generalizes to any dimension and it typically produces meshes of very high quality. We show a simplified version of the method in just one page of MATLAB code, and we describe how to improve and extend our implementation. Prior to generating the mesh we compute a mesh size function to specify the desired size of the elements. We have developed algorithms for automatic generation of size functions, adapted to the curvature and the feature size of the geometry. We propose a new method for limiting the gradients in the size function by solving a non-linear partial differential equation. We show that the solution to our gradient limiting equation is optimal for convex geometries, and we discuss efficient methods to solve it numerically. The iterative nature of the algorithm makes it particularly useful for moving meshes, and we show how to combine it with the level set method for applications in fluid dynamics, shape optimization, and structural deformations. It is also appropriate for numerical adaptation, where the previous mesh is used to represent the size function and as the initial mesh for the refinements. Finally, we show how to generate meshes for regions in images by using implicit representations. by Per-Olof Persson. Ph.D. 2008-02-28T16:03:44Z 2008-02-28T16:03:44Z 2005 2005 Thesis http://dspace.mit.edu/handle/1721.1/27866 http://hdl.handle.net/1721.1/27866 60503856 eng M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/27866 http://dspace.mit.edu/handle/1721.1/7582 126 p. application/pdf Massachusetts Institute of Technology
spellingShingle Mathematics.
Persson, Per-Olof, 1973-
Mesh generation for implicit geometries
title Mesh generation for implicit geometries
title_full Mesh generation for implicit geometries
title_fullStr Mesh generation for implicit geometries
title_full_unstemmed Mesh generation for implicit geometries
title_short Mesh generation for implicit geometries
title_sort mesh generation for implicit geometries
topic Mathematics.
url http://dspace.mit.edu/handle/1721.1/27866
http://hdl.handle.net/1721.1/27866
work_keys_str_mv AT perssonperolof1973 meshgenerationforimplicitgeometries