{"id":{"repo_id":"utc","oai_identifier":"oai:scholar.utc.edu:theses-1575"},"canonical_url":"https://search.dev.ndltd.org/etd/utc/oai:scholar.utc.edu:theses-1575","repository":{"repo_id":"utc","name":"University of Tennessee - Chattanooga","base_url":"https://scholar.utc.edu/do/oai/"},"display":{"title":"The development of an all quadrilateral boundary conforming grid generator for high order finite element methods","abstract":"A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform Rational B-Spline curve fitter is implemented to replicate the curvature of the geometries. The grid elements on the boundaries conform to the curved structure to support high order accuracy for a finite element scheme. Various geometries are used to test the robustness and generality of the meshing algorithm. The initial problems that were encountered are discussed and the solutions explained. The speed of the algorithm is discussed together with the effect of grid and geometry size on runtime. A finite element solver is used to validate the grids. The order of accuracy of the scheme is demonstrated for quadrilateral grids and increased order is compared with a refined grid study.","abstract_html":"A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform Rational B-Spline curve fitter is implemented to replicate the curvature of the geometries. The grid elements on the boundaries conform to the curved structure to support high order accuracy for a finite element scheme. Various geometries are used to test the robustness and generality of the meshing algorithm. The initial problems that were encountered are discussed and the solutions explained. The speed of the algorithm is discussed together with the effect of grid and geometry size on runtime. A finite element solver is used to validate the grids. The order of accuracy of the scheme is demonstrated for quadrilateral grids and increased order is compared with a refined grid study.","abstract_has_math":false,"creators":["Barker, Mary A"],"institution":"University of Tennessee at Chattanooga","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Taylor, Lafayette K.","Karman, Steve L., Jr.; Newman, James C., III; Sreenivas, Kidambi","College of Engineering and Computer Science"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T05:46:28Z","subjects":["Numerical grid generation (Numerical analysis)","Computer algorithms"],"languages":["English","eng"],"rights":[],"rights_urls":["https://rightsstatements.org/page/InC/1.0/?language=en"],"identifier_entries":[]},"links":{"outbound_url":"https://scholar.utc.edu/theses/434","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Taylor, Lafayette K.","Karman, Steve L., Jr.; Newman, James C., III; Sreenivas, Kidambi","College of Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Barker, Mary A"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2015-12-01T08:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"]},{"key":"dc:relation","label":"Dc Relation","values":["Masters Theses and Doctoral Dissertations"]},{"key":"dc:type","label":"Dc Type","values":["Masters theses","Text"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Numerical grid generation (Numerical analysis)","Computer algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["English","eng"]},{"key":"dc:rights","label":"Dc Rights","values":["https://rightsstatements.org/page/InC/1.0/?language=en"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://scholar.utc.edu/theses/434"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Dept. of Computational Engineering","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."]},{"key":"dc:description.abstract","label":"Abstract","values":["A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform Rational B-Spline curve fitter is implemented to replicate the curvature of the geometries. The grid elements on the boundaries conform to the curved structure to support high order accuracy for a finite element scheme. Various geometries are used to test the robustness and generality of the meshing algorithm. The initial problems that were encountered are discussed and the solutions explained. The speed of the algorithm is discussed together with the effect of grid and geometry size on runtime. A finite element solver is used to validate the grids. The order of accuracy of the scheme is demonstrated for quadrilateral grids and increased order is compared with a refined grid study."]},{"key":"dc:title","label":"Title","values":["The development of an all quadrilateral boundary conforming grid generator for high order finite element methods"]}]}],"canonical_facts":{"dc:contributor":["Taylor, Lafayette K.","Karman, Steve L., Jr.; Newman, James C., III; Sreenivas, Kidambi","College of Engineering and Computer Science"],"dc:creator":["Barker, Mary A"],"dc:date":["2015-12-01T08:00:00Z"],"dc:description":["Dept. of Computational Engineering","M. S.; A thesis submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Master of Science."],"dc:description.abstract":["A grid generator is developed that produces all quadrilateral meshes. The scheme is automated to work for arbitrary choice of geometry. In addition, a Non-Uniform Rational B-Spline curve fitter is implemented to replicate the curvature of the geometries. The grid elements on the boundaries conform to the curved structure to support high order accuracy for a finite element scheme. Various geometries are used to test the robustness and generality of the meshing algorithm. The initial problems that were encountered are discussed and the solutions explained. The speed of the algorithm is discussed together with the effect of grid and geometry size on runtime. A finite element solver is used to validate the grids. The order of accuracy of the scheme is demonstrated for quadrilateral grids and increased order is compared with a refined grid study."],"dc:identifier":["https://scholar.utc.edu/theses/434"],"dc:language":["English","eng"],"dc:publisher":["University of Tennessee at Chattanooga","Chattanooga (Tenn.)"],"dc:relation":["Masters Theses and Doctoral Dissertations"],"dc:rights":["https://rightsstatements.org/page/InC/1.0/?language=en"],"dc:subject":["Numerical grid generation (Numerical analysis)","Computer algorithms"],"dc:title":["The development of an all quadrilateral boundary conforming grid generator for high order finite element methods"],"dc:type":["Masters theses","Text"]},"updated_at":"2026-07-24T05:46:28Z"}