Show simple item record

FieldValueLanguage
dc.contributor.authorEngwirda, Darren
dc.date.accessioned2015-04-20
dc.date.available2015-04-20
dc.date.issued2014-11-01
dc.identifier.urihttp://hdl.handle.net/2123/13148
dc.description.abstractThe field of mesh generation concerns the development of efficient algorithmic techniques to construct high-quality tessellations of complex geometrical objects. In this thesis, I investigate the problem of unstructured simplicial mesh generation for problems in two- and three-dimensional spaces, in which meshes consist of collections of triangular and tetrahedral elements. I focus on the development of efficient algorithms and computer programs to produce high-quality meshes for planar, surface and volumetric objects of arbitrary complexity. I develop and implement a number of new algorithms for mesh construction based on the Frontal-Delaunay paradigm - a hybridisation of conventional Delaunay-refinement and advancing-front techniques. I show that the proposed algorithms are a significant improvement on existing approaches, typically outperforming the Delaunay-refinement technique in terms of both element shape- and size-quality, while offering significantly improved theoretical robustness compared to advancing-front techniques. I verify experimentally that the proposed methods achieve the same element shape- and size-guarantees that are typically associated with conventional Delaunay-refinement techniques. In addition to mesh construction, methods for mesh improvement are also investigated. I develop and implement a family of techniques designed to improve the element shape quality of existing simplicial meshes, using a combination of optimisation-based vertex smoothing, local topological transformation and vertex insertion techniques. These operations are interleaved according to a new priority-based schedule, and I show that the resulting algorithms are competitive with existing state-of-the-art approaches in terms of mesh quality, while offering significant improvements in computational efficiency. Optimised C++ implementations for the proposed mesh generation and mesh optimisation algorithms are provided in the JIGSAW and JITTERBUG software libraries.en_AU
dc.subjectMesh-generationen_AU
dc.subjectDelaunay-refinementen_AU
dc.subjectFrontal-Delaunayen_AU
dc.titleLocally optimal Delaunay-refinement and optimisation-based mesh generationen_AU
dc.typeThesisen_AU
dc.date.valid2015-01-01en_AU
dc.type.thesisDoctor of Philosophyen_AU
usyd.facultyFaculty of Science, School of Mathematics and Statisticsen_AU
usyd.degreeDoctor of Philosophy Ph.D.en_AU
usyd.awardinginstThe University of Sydneyen_AU


Show simple item record

Associated file/s

Associated collections

Show simple item record

There are no previous versions of the item available.