Overlaying Surface Meshes: Extension and Parallelization

Many computational applications involve multiple physical components and require exchanging data across the interface between them, often on parallel computers. The interface is typically represented by surface meshes that are non-matching, with differing connectivities and geometry. To transfer data accurately and conservatively, it is important to construct a common refinement (or common tessellation) of these surface meshes. Previously, Jiao and Heath developed an algorithm for constructing a common refinement by overlaying the surface meshes. The original algorithm was efficient and robust but unfortunately was complex and difficult to implement and parallelize. In this paper, we present a modified algorithm for overlaying surface meshes. Our algorithm employs a higher-level primitive, namely face-face intersection, to facilitate easy parallelization of mesh overlay while retaining the robustness of the original algorithm. We also introduce a safeguarded projection primitives to improve the robustness against non-matching features and potential topological inconsistencies. We present numerical examples to demonstrate the robustness and effectiveness of the new method on parallel computers.

[1]  Leonidas J. Guibas,et al.  Computing convolutions by reciprocal search , 1986, SCG '86.

[2]  Marc Levoy,et al.  Zippered polygon meshes from range images , 1994, SIGGRAPH.

[3]  Joseph O'Rourke,et al.  Computational Geometry in C. , 1995 .

[4]  Charbel Farhat,et al.  Matching fluid and structure meshes for aeroelastic computations : a parallel approach , 1995 .

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  J. O´Rourke,et al.  Computational Geometry in C: Arrangements , 1998 .

[7]  Steven J. Plimpton,et al.  A Parallel Rendezvous Algorithm for Interpolation Between Multiple Grids , 1998, Proceedings of the IEEE/ACM SC98 Conference.

[8]  Michael T. Heath,et al.  Mesh Association: Formulation and Algorithms , 1999, IMR.

[9]  Marc Alexa.  Merging polyhedral shapes with scattered features , 2000, The Visual Computer.

[10]  John M. Schreiner,et al.  Inter-surface mapping , 2004, SIGGRAPH 2004.

[11]  Vladislav Kraevoy,et al.  Cross-parameterization and compatible remeshing of 3D models , 2004, SIGGRAPH 2004.

[12]  Michael T. Heath,et al.  Overlaying surface meshes, part I: algorithms , 2004, Int. J. Comput. Geom. Appl..

[13]  Michael T. Heath,et al.  Common‐refinement‐based data transfer between non‐matching meshes in multiphysics simulations , 2004 .

[14]  F. Chazal,et al.  OrthoMap: Homeomorphism-guaranteeing normal-projection map between surfaces , 2004 .

[15]  Michael T. Heath,et al.  Overlaying surface meshes, part II: topology preservation and feature matching , 2004, Int. J. Comput. Geom. Appl..

[16]  van Eh Harald Brummelen,et al.  Mesh association by projection along smoothed‐normal‐vector fields: Association of closed manifolds , 2006 .