Automatic mesh split-and-merge technique for multiple surface models

In three-dimensional visualization, simulation and modeling applications, surface split-and-merge is a vital technique which creates a complete three-dimensional model that merges individual characterization and properties of multiple surface models. This paper presents an automatic mesh split-and-merge method to handle with the intersection detection, split and mergence processes between multiple surface models. All input models are firstly converted into the uniform triangular representation which retains fine surface features, and the bounding volume hierarchies are built for each model. And then, the hybrid bounding box technique based on the collision detection is used to classify the intersection triangle pairs between models. Furthermore, intersection line segments among these triangle pairs are accurately determined and used to re-mesh models based on the Constrained Delaunay. Finally, input models are split into distinct surface patches which will be merged into a complete surface model based on in-out tests technique. The presented method has been integrated into an automatic model mergence system, and experimental results demonstrate it can effectively and robustly merge multiple surface models.

[1]  Marcel Campen,et al.  Exact and Robust (Self‐)Intersections for Polygonal Meshes , 2010, Comput. Graph. Forum.

[2]  C.-J. Wang,et al.  Boolean operations of STL models based on loop detection , 2007 .

[3]  R Löhner,et al.  Merging of intersecting triangulations for finite element modeling. , 2001, Journal of biomechanics.

[4]  M. Gross,et al.  Deforming meshes that split and merge , 2009, SIGGRAPH 2009.

[5]  Markus H. Gross,et al.  Deforming meshes that split and merge , 2009, ACM Trans. Graph..

[6]  Ji Xing Method of Boolean operation based on 3D grid model , 2011 .

[7]  Tomas Möller,et al.  A fast triangle-triangle intersection test , 1997 .

[8]  David H. Laidlaw,et al.  Constructive solid geometry for polyhedral objects , 1986, SIGGRAPH.

[9]  Tomas Akenine-Möller,et al.  A Fast Triangle-Triangle Intersection Test , 1997, J. Graphics, GPU, & Game Tools.

[10]  Olivier Devillers,et al.  Fast and Robust Triangle-Triangle Overlap Test Using Orientation Predicates , 2003, J. Graphics, GPU, & Game Tools.

[11]  George K. Knopf,et al.  Merging multiple B-spline surface patches in a virtual reality environment , 2010, Comput. Aided Des..

[12]  William J. Schroeder,et al.  Visualizing with VTK: A Tutorial , 2000, IEEE Computer Graphics and Applications.

[13]  Christer Ericson,et al.  Real-Time Collision Detection (The Morgan Kaufmann Series in Interactive 3-D Technology) (The Morgan Kaufmann Series in Interactive 3D Technology) , 2004 .

[14]  Václav Skala,et al.  Barycentric coordinates computation in homogeneous coordinates , 2008, Comput. Graph..

[15]  Martin Held,et al.  ERIT - A Collection of Efficient and Reliable Intersection Tests , 1997, J. Graphics, GPU, & Game Tools.

[16]  Myung-Soo Kim,et al.  Efficient triangle-triangle intersection test for OBB-based collision detection , 2009, Comput. Graph..

[17]  K. -B. Guo,et al.  Boolean operations of STL models based on loop detection , 2007 .