Show simple item record

dc.contributor.advisorKlaus-Jürgen Bathe.
dc.contributor.authorFoo, Angus.en_US
dc.contributor.otherMassachusetts Institute of Technology. Computation for Design and Optimization Program.en_US
dc.date.accessioned2021-12-17T17:04:37Z
dc.date.available2021-12-17T17:04:37Z
dc.date.copyright2020en_US
dc.date.issued2020en_US
dc.identifier.urihttps://hdl.handle.net/1721.1/138520
dc.descriptionThesis: S.M., Massachusetts Institute of Technology, Computation for Design and Optimization Program, February, 2020en_US
dc.descriptionManuscript.en_US
dc.descriptionIncludes bibliographical references (pages 75-78).en_US
dc.description.abstractTraditional Finite Element (FE) analysis requires the discretisation of continuous bodies into connected meshes of triangles and quadrilaterals (in 2D; tetrahedrals [tet] and hexahedrals [hex] in 3D) elements. Besides the restrictions due to compatibility of adjacent elements, one primary concern regarding mesh generation is that of minimizing the distortion of elements and the number of distorted elements so as to reduce the discretisation error. This has generally steered research in 2D mesh generation techniques away from grid-based methods, which tends to generate significant numbers of distorted elements; additionally, such methods are generally not considered at all in 3D mesh generation. Furthermore, significant amounts of man-hours are used during the meshing phase of FE analyses to partition and prescribe element types, where the ability to mesh portions of the geometry with hex elements is preferred over using tet elements in the mesh. The recent advances in the theory of Overlapping Finite Elements (OFE) now allow for the use of distorted elements without compromising on the accuracy of the FE analysis. However, a trade-off arises because more degrees of freedom (DOFs) are required at triangular (and tetrahedral) nodes. We propose the reintroduction of optimised 2D grid-based mesh generation techniques to decrease the DOFs in a way that is generalizable to arbitrary 3D geometries, as part of a step towards a truly automated meshing paradigm, referred to as the Automatic Meshing with Overlapping and Regular Elements (AMORE), which requires minimal-to-no input from the engineer.en_US
dc.description.statementofresponsibilityby Angus Foo.en_US
dc.format.extent78 pagesen_US
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsMIT theses may be protected by copyright. Please reuse MIT thesis content according to the MIT Libraries Permissions Policy, which is available through the URL provided.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582en_US
dc.subjectComputation for Design and Optimization Program.en_US
dc.titleContributions to automatic meshing in the AMORE schemeen_US
dc.typeThesisen_US
dc.description.degreeS.M.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computation for Design and Optimization Programen_US
dc.identifier.oclc1281184865en_US
dc.description.collectionS.M. Massachusetts Institute of Technology, Computation for Design and Optimization Programen_US
dspace.imported2021-12-17T17:04:37Zen_US
mit.thesis.degreeMasteren_US
mit.thesis.departmentCDOen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record