{"id":{"repo_id":"aachen","oai_identifier":"oai:publications.rwth-aachen.de:56785"},"canonical_url":"https://search.dev.ndltd.org/etd/aachen/oai:publications.rwth-aachen.de:56785","repository":{"repo_id":"aachen","name":"RWTH Aachen University","base_url":"https://publications.rwth-aachen.de/oai2d"},"display":{"title":"3D-Netzgenerierung für Fließgewässer","abstract":"This work originated in the course of the DFG-projekt \"Numerical simulation of flow in natural flow waters\" which the Institute of Applied Mathematics especially Information Science resp. the Institute of Information Science VII leaded in cooperation with the Institute of Hydraulic Engineering and Water Resources Management of the Aachen University of Technology. Physical processes can be simulated by partial differential equations that can be solved i.e. numerical with the finite-element-method and requires adjusted nets. So far for simulations of flow waters mainly one or two dimensional methods of calculations were used. However complex geometries with complex flow procedures demand a complete three dimensional numerical simulation system with free surface flow, for which certain additional conditions and requirements have to be kept. Methods for the 3D-netgeneration for this problem-area with the here valid restrictions are not known so far. In this work a new solution-concept for the generation of such 3D-nets is presented. An essential step is the creation of a thus named \"2D-map\" (P-net), which already contains (except for optimization) all essential controls for the 3D-netgeneration. The production of not allowed and therefore still to be decomposed 3D-elements is in general not preventible. The P-netgeneration orientates mainly at the reduction of the generation of elements of the p-plane which will become to be decomposed elements by the 3D-generation. The decomposition of the to be decomposed 3D-elements represents an optimization problem. This problem is transfered to an optimization problem of graph theory, for which a new efficient algorithm is developed in the course of this work. Algorithms for that problem are not known in the literature. Therefore this dissertation presents new and important results of research in several respects.","abstract_html":"This work originated in the course of the DFG-projekt "Numerical simulation of flow in natural flow waters" which the Institute of Applied Mathematics especially Information Science resp. the Institute of Information Science VII leaded in cooperation with the Institute of Hydraulic Engineering and Water Resources Management of the Aachen University of Technology. Physical processes can be simulated by partial differential equations that can be solved i.e. numerical with the finite-element-method and requires adjusted nets. So far for simulations of flow waters mainly one or two dimensional methods of calculations were used. However complex geometries with complex flow procedures demand a complete three dimensional numerical simulation system with free surface flow, for which certain additional conditions and requirements have to be kept. Methods for the 3D-netgeneration for this problem-area with the here valid restrictions are not known so far. In this work a new solution-concept for the generation of such 3D-nets is presented. An essential step is the creation of a thus named "2D-map" (P-net), which already contains (except for optimization) all essential controls for the 3D-netgeneration. The production of not allowed and therefore still to be decomposed 3D-elements is in general not preventible. The P-netgeneration orientates mainly at the reduction of the generation of elements of the p-plane which will become to be decomposed elements by the 3D-generation. The decomposition of the to be decomposed 3D-elements represents an optimization problem. This problem is transfered to an optimization problem of graph theory, for which a new efficient algorithm is developed in the course of this work. Algorithms for that problem are not known in the literature. Therefore this dissertation presents new and important results of research in several respects.","abstract_has_math":false,"creators":["Dittrich, Irmgard"],"institution":"Publikationsserver der RWTH Aachen University","degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":null,"school":null,"contributors":["Oberschelp, Walter"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2002,"date_issued":"2002","date_published":"2002","updated_at":"2026-07-30T19:42:01Z","subjects":["info:eu-repo/classification/ddc/004","Informatik","Fließgewässer","Wasserströmung","Gittererzeugung"],"languages":["ger"],"rights":["info:eu-repo/semantics/openAccess"],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118872%22"],"render_values":[{"text":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118872%22","href":"https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118872%22","code":true}]}]},"links":{"outbound_url":"https://publications.rwth-aachen.de/record/56785","outbound_label":"Repository record","outbound_source":"dc:identifier"},"source_record":{"url":"https://publications.rwth-aachen.de/oai2d?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Apublications.rwth-aachen.de%3A56785","prefix":"oai_dc"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Oberschelp, Walter"]},{"key":"dc:creator","label":"Author","values":["Dittrich, Irmgard"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:coverage","label":"Dc Coverage","values":["DE"]},{"key":"dc:date","label":"Dc Date","values":["2002"]},{"key":"dc:publisher","label":"Institution","values":["Publikationsserver der RWTH Aachen University"]},{"key":"dc:relation","label":"Dc Relation","values":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-2652"]},{"key":"dc:type","label":"Dc Type","values":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["info:eu-repo/classification/ddc/004","Informatik","Fließgewässer","Wasserströmung","Gittererzeugung"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["ger"]},{"key":"dc:rights","label":"Dc Rights","values":["info:eu-repo/semantics/openAccess"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://publications.rwth-aachen.de/record/56785","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118872%22"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["This work originated in the course of the DFG-projekt \"Numerical simulation of flow in natural flow waters\" which the Institute of Applied Mathematics especially Information Science resp. the Institute of Information Science VII leaded in cooperation with the Institute of Hydraulic Engineering and Water Resources Management of the Aachen University of Technology. Physical processes can be simulated by partial differential equations that can be solved i.e. numerical with the finite-element-method and requires adjusted nets. So far for simulations of flow waters mainly one or two dimensional methods of calculations were used. However complex geometries with complex flow procedures demand a complete three dimensional numerical simulation system with free surface flow, for which certain additional conditions and requirements have to be kept. Methods for the 3D-netgeneration for this problem-area with the here valid restrictions are not known so far. In this work a new solution-concept for the generation of such 3D-nets is presented. An essential step is the creation of a thus named \"2D-map\" (P-net), which already contains (except for optimization) all essential controls for the 3D-netgeneration. The production of not allowed and therefore still to be decomposed 3D-elements is in general not preventible. The P-netgeneration orientates mainly at the reduction of the generation of elements of the p-plane which will become to be decomposed elements by the 3D-generation. The decomposition of the to be decomposed 3D-elements represents an optimization problem. This problem is transfered to an optimization problem of graph theory, for which a new efficient algorithm is developed in the course of this work. Algorithms for that problem are not known in the literature. Therefore this dissertation presents new and important results of research in several respects."]},{"key":"dc:source","label":"Dc Source","values":["Aachen : Publikationsserver der RWTH Aachen University XVI, 258 S. : graph. Darst. (2002). = Aachen, Techn. Hochsch., Diss., 2001"]},{"key":"dc:title","label":"Title","values":["3D-Netzgenerierung für Fließgewässer"]}]}],"canonical_facts":{"dc:contributor":["Oberschelp, Walter"],"dc:coverage":["DE"],"dc:creator":["Dittrich, Irmgard"],"dc:date":["2002"],"dc:description":["This work originated in the course of the DFG-projekt \"Numerical simulation of flow in natural flow waters\" which the Institute of Applied Mathematics especially Information Science resp. the Institute of Information Science VII leaded in cooperation with the Institute of Hydraulic Engineering and Water Resources Management of the Aachen University of Technology. Physical processes can be simulated by partial differential equations that can be solved i.e. numerical with the finite-element-method and requires adjusted nets. So far for simulations of flow waters mainly one or two dimensional methods of calculations were used. However complex geometries with complex flow procedures demand a complete three dimensional numerical simulation system with free surface flow, for which certain additional conditions and requirements have to be kept. Methods for the 3D-netgeneration for this problem-area with the here valid restrictions are not known so far. In this work a new solution-concept for the generation of such 3D-nets is presented. An essential step is the creation of a thus named \"2D-map\" (P-net), which already contains (except for optimization) all essential controls for the 3D-netgeneration. The production of not allowed and therefore still to be decomposed 3D-elements is in general not preventible. The P-netgeneration orientates mainly at the reduction of the generation of elements of the p-plane which will become to be decomposed elements by the 3D-generation. The decomposition of the to be decomposed 3D-elements represents an optimization problem. This problem is transfered to an optimization problem of graph theory, for which a new efficient algorithm is developed in the course of this work. Algorithms for that problem are not known in the literature. Therefore this dissertation presents new and important results of research in several respects."],"dc:identifier":["https://publications.rwth-aachen.de/record/56785","https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-118872%22"],"dc:language":["ger"],"dc:publisher":["Publikationsserver der RWTH Aachen University"],"dc:relation":["info:eu-repo/semantics/altIdentifier/urn/urn:nbn:de:hbz:82-opus-2652"],"dc:rights":["info:eu-repo/semantics/openAccess"],"dc:source":["Aachen : Publikationsserver der RWTH Aachen University XVI, 258 S. : graph. Darst. (2002). = Aachen, Techn. Hochsch., Diss., 2001"],"dc:subject":["info:eu-repo/classification/ddc/004","Informatik","Fließgewässer","Wasserströmung","Gittererzeugung"],"dc:title":["3D-Netzgenerierung für Fließgewässer"],"dc:type":["info:eu-repo/semantics/doctoralThesis","info:eu-repo/semantics/publishedVersion"]},"updated_at":"2026-07-30T19:42:01Z"}