Show simple item record

dc.contributor.advisorAlan Edelman and Gilbert Strang.en_US
dc.contributor.authorPersson, Per-Olof, 1973-en_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Mathematics.en_US
dc.date.accessioned2008-02-28T16:03:44Z
dc.date.available2008-02-28T16:03:44Z
dc.date.copyright2005en_US
dc.date.issued2005en_US
dc.identifier.urihttp://dspace.mit.edu/handle/1721.1/27866en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/27866
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 2005.en_US
dc.descriptionIncludes bibliographical references (p. 119-126).en_US
dc.description.abstractWe 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.en_US
dc.description.statementofresponsibilityby Per-Olof Persson.en_US
dc.format.extent126 p.en_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.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.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/27866en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectMathematics.en_US
dc.titleMesh generation for implicit geometriesen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Mathematics
dc.identifier.oclc60503856en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record