{"extern":"1","date_published":"1999-10-01T00:00:00Z","oa_version":"None","year":"1999","quality_controlled":"1","type":"conference","language":[{"iso":"eng"}],"_id":"3554","citation":{"chicago":"Jiao, Xiangmin, Herbert Edelsbrunner, and Michael Heath. “Mesh Association: Formulation and Algorithms.” In <i>Proceedings of the 8th International Meshing Roundtable</i>, 75–82. Elsevier, 1999.","apa":"Jiao, X., Edelsbrunner, H., &#38; Heath, M. (1999). Mesh association: formulation and algorithms. In <i>Proceedings of the 8th International Meshing Roundtable</i> (pp. 75–82). South Lake Tahoe, CA, United States of America: Elsevier.","mla":"Jiao, Xiangmin, et al. “Mesh Association: Formulation and Algorithms.” <i>Proceedings of the 8th International Meshing Roundtable</i>, Elsevier, 1999, pp. 75–82.","short":"X. Jiao, H. Edelsbrunner, M. Heath, in:, Proceedings of the 8th International Meshing Roundtable, Elsevier, 1999, pp. 75–82.","ieee":"X. Jiao, H. Edelsbrunner, and M. Heath, “Mesh association: formulation and algorithms,” in <i>Proceedings of the 8th International Meshing Roundtable</i>, South Lake Tahoe, CA, United States of America, 1999, pp. 75–82.","ista":"Jiao X, Edelsbrunner H, Heath M. 1999. Mesh association: formulation and algorithms. Proceedings of the 8th International Meshing Roundtable. IMR: International Meshing Roundtable, 75–82.","ama":"Jiao X, Edelsbrunner H, Heath M. Mesh association: formulation and algorithms. In: <i>Proceedings of the 8th International Meshing Roundtable</i>. Elsevier; 1999:75-82."},"publist_id":"2831","author":[{"full_name":"Jiao, Xiangmin","last_name":"Jiao","first_name":"Xiangmin"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"full_name":"Heath, Michael","last_name":"Heath","first_name":"Michael"}],"abstract":[{"text":"In computational simulation of coupled, multicomponent systems, it is frequently necessary to transfer data between meshes that may differ in resolution, structure, and discretization methodology. Typically, nodes from one mesh must be associated with elements of another mesh. In this paper, we formulate mesh association as a geometric problem and introduce two efficient mesh association algorithms. One of these algorithms requires linear time in the worst case if the meshes are well shaped and geometrically well aligned. Our formulation of the problem and our algorithms are more general than previous work and can be applied to surface meshes with curved elements.","lang":"eng"}],"date_created":"2018-12-11T12:03:56Z","conference":{"location":"South Lake Tahoe, CA, United States of America","start_date":"1999-10-10","end_date":"1999-10-13","name":"IMR: International Meshing Roundtable"},"article_processing_charge":"No","page":"75 - 82","status":"public","main_file_link":[{"url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.2959"}],"day":"01","publication_status":"published","publication":"Proceedings of the 8th International Meshing Roundtable","month":"10","user_id":"ea97e931-d5af-11eb-85d4-e6957dddbf17","date_updated":"2022-09-06T09:35:53Z","title":"Mesh association: formulation and algorithms","publisher":"Elsevier"}