{"id":{"repo_id":"utc","oai_identifier":"oai:scholar.utc.edu:theses-1683"},"canonical_url":"https://search.dev.ndltd.org/etd/utc/oai:scholar.utc.edu:theses-1683","repository":{"repo_id":"utc","name":"University of Tennessee - Chattanooga","base_url":"https://scholar.utc.edu/do/oai/"},"display":{"title":"A physics-based adaptive point distribution method for computational domain discretization","abstract":"Two algorithms are presented which together generate well-spaced point distributions applied to curves, surfaces, and the volume of a computational domain. The first is a force equilibrium simulation which applies a simplified direct solution of the equations of motion at each node. Inter-nodal pair forces are computed based on the desired spacing between nodes and summed to provide a net force on each node. The nodes are allowed to travel a restricted distance with each locally distinct time step. The motion of the point distribution is stabilized by applying friction to each node from its neighboring nodes as well as globally restricting the time step size over the series of iterations. Second, an algorithm for node population adaptation is presented which deletes nodes or inserts new nodes depending on how well the local concentration of nodes matches a desired local spacing prescription, or spacing field. Experimental results are provided which demonstrate the ability of these algorithms to generate smooth distributions of points matching various spacing field function definitions.","abstract_html":"Two algorithms are presented which together generate well-spaced point distributions applied to curves, surfaces, and the volume of a computational domain. The first is a force equilibrium simulation which applies a simplified direct solution of the equations of motion at each node. Inter-nodal pair forces are computed based on the desired spacing between nodes and summed to provide a net force on each node. The nodes are allowed to travel a restricted distance with each locally distinct time step. The motion of the point distribution is stabilized by applying friction to each node from its neighboring nodes as well as globally restricting the time step size over the series of iterations. Second, an algorithm for node population adaptation is presented which deletes nodes or inserts new nodes depending on how well the local concentration of nodes matches a desired local spacing prescription, or spacing field. Experimental results are provided which demonstrate the ability of these algorithms to generate smooth distributions of points matching various spacing field function definitions.","abstract_has_math":false,"creators":["Fackler, Philip W."],"institution":"University of Tennessee at Chattanooga","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Hilbert, C. Bruce","Karman, Steve L., Jr.; Sreenivas, Kidambi; Webster, Robert","College of Engineering and Computer Science"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-07-24T05:46:51Z","subjects":["Numerical analysis","Differential equations -- Numerical solutions"],"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/529","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Hilbert, C. Bruce","Karman, Steve L., Jr.; Sreenivas, Kidambi; Webster, Robert","College of Engineering and Computer Science"]},{"key":"dc:creator","label":"Author","values":["Fackler, Philip W."]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2017-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":["Doctoral dissertations","Text"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Numerical analysis","Differential equations -- Numerical solutions"]}]},{"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/529"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Dept. of Computational Engineering","Ph. D.; A dissertation submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Doctor of Philosophy."]},{"key":"dc:description.abstract","label":"Abstract","values":["Two algorithms are presented which together generate well-spaced point distributions applied to curves, surfaces, and the volume of a computational domain. The first is a force equilibrium simulation which applies a simplified direct solution of the equations of motion at each node. Inter-nodal pair forces are computed based on the desired spacing between nodes and summed to provide a net force on each node. The nodes are allowed to travel a restricted distance with each locally distinct time step. The motion of the point distribution is stabilized by applying friction to each node from its neighboring nodes as well as globally restricting the time step size over the series of iterations. Second, an algorithm for node population adaptation is presented which deletes nodes or inserts new nodes depending on how well the local concentration of nodes matches a desired local spacing prescription, or spacing field. Experimental results are provided which demonstrate the ability of these algorithms to generate smooth distributions of points matching various spacing field function definitions."]},{"key":"dc:title","label":"Title","values":["A physics-based adaptive point distribution method for computational domain discretization"]}]}],"canonical_facts":{"dc:contributor":["Hilbert, C. Bruce","Karman, Steve L., Jr.; Sreenivas, Kidambi; Webster, Robert","College of Engineering and Computer Science"],"dc:creator":["Fackler, Philip W."],"dc:date":["2017-12-01T08:00:00Z"],"dc:description":["Dept. of Computational Engineering","Ph. D.; A dissertation submitted to the faculty of the University of Tennessee at Chattanooga in partial fulfillment of the requirements of the degree of Doctor of Philosophy."],"dc:description.abstract":["Two algorithms are presented which together generate well-spaced point distributions applied to curves, surfaces, and the volume of a computational domain. The first is a force equilibrium simulation which applies a simplified direct solution of the equations of motion at each node. Inter-nodal pair forces are computed based on the desired spacing between nodes and summed to provide a net force on each node. The nodes are allowed to travel a restricted distance with each locally distinct time step. The motion of the point distribution is stabilized by applying friction to each node from its neighboring nodes as well as globally restricting the time step size over the series of iterations. Second, an algorithm for node population adaptation is presented which deletes nodes or inserts new nodes depending on how well the local concentration of nodes matches a desired local spacing prescription, or spacing field. Experimental results are provided which demonstrate the ability of these algorithms to generate smooth distributions of points matching various spacing field function definitions."],"dc:identifier":["https://scholar.utc.edu/theses/529"],"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 analysis","Differential equations -- Numerical solutions"],"dc:title":["A physics-based adaptive point distribution method for computational domain discretization"],"dc:type":["Doctoral dissertations","Text"]},"updated_at":"2026-07-24T05:46:51Z"}