Mesh association: formulation and algorithms

X. Jiao, H. Edelsbrunner, M. Heath, in:, Elsevier, 1999, pp. 75–82.

Download
No fulltext has been uploaded. References only!
Conference Paper | Published
Author
; ;
Abstract
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.
Publishing Year
Date Published
1999-10-01
Page
75 - 82
Conference
IMR: International Meshing Roundtable
IST-REx-ID

Cite this

Jiao X, Edelsbrunner H, Heath M. Mesh association: formulation and algorithms. In: Elsevier; 1999:75-82.
Jiao, X., Edelsbrunner, H., & Heath, M. (1999). Mesh association: formulation and algorithms (pp. 75–82). Presented at the IMR: International Meshing Roundtable, Elsevier.
Jiao, Xiangmin, Herbert Edelsbrunner, and Michael Heath. “Mesh Association: Formulation and Algorithms,” 75–82. Elsevier, 1999.
X. Jiao, H. Edelsbrunner, and M. Heath, “Mesh association: formulation and algorithms,” presented at the IMR: International Meshing Roundtable, 1999, pp. 75–82.
Jiao X, Edelsbrunner H, Heath M. 1999. Mesh association: formulation and algorithms. IMR: International Meshing Roundtable 75–82.
Jiao, Xiangmin, et al. Mesh Association: Formulation and Algorithms. Elsevier, 1999, pp. 75–82.

Link(s) to Main File(s)
Access Level
Restricted Closed Access

Export

Marked Publications

Open Data IST Research Explorer

Search this title in

Google Scholar