Building Three-Dimensional Merged Surface Model from Polygonal Models

Abstract:

Three-dimensional surface merging plays an important role in rapid prototyping manufacture, physically based modeling and finite element analysis. In this paper, a rapid merging method is proposed to build three-dimensional water-proof surface model from polygonal models. To rapidly determine merging boundaries, collision detection techniques are used to obtain the intersection triangle pairs between the two input models, and then the intersection line loops are accurately computed. Furthermore, triangle tessellation and edge searching method is used to generate new triangles and classify each triangle in models into different triangle sets. Finally, an inclusion test determines the position of each triangle set and stitches the labeled triangle sets into the merged model. The experimental results demonstrate the robustness and adaptability of the presented method.

• Periodical: Advanced Materials Research (Volume 566)
• Pages: 336-341
• DOI: https://doi.org/10.4028/www.scientific.net/AMR.566.336
• Online since: September 2012
• Authors: Jian Jun Du, Xin Yu Guo, Sheng Lian Lu, Bo Xiang Xiao, Jian Wei Wu
• Keywords: Collision Detection, Intersection Test, Model Merging

References

[1] K.B. Guo, L. C Zhang, C.J. Wang and S. H. Huang, Boolean operations of STL models based on loop detection, International Journal of Advanced Manufacturing Technology. 33 (2007) 627-633.

DOI: 10.1007/s00170-006-0487-5

[2] S.H. Lo, W.X. Wang, Finite element mesh generation over intersecting curved surfaces by tracing of neighbours, Finite Elem. Anal. Des. 41 (2005) 351-370.

DOI: 10.1016/j.finel.2004.07.002

[3] K. Pekkan, D. De Zelicourt, L. Ge, Physics-driven CFD modeling of complex anatomical cardiovascular flows - A TCPC case study, Annals of Biomedical Engineering. 33 (2005) 284-300.

DOI: 10.1007/s10439-005-1731-0

[4] W. Sun, X. Hu, Reasoning boolean operation based modeling for heterogenous objects, Computer-Aided Design. 34 (2002) 481-488.

DOI: 10.1016/s0010-4485(01)00131-2

[5] M. Campen and L. Kobbelt, Exact and robust (self-) intersections for polygonal Meshes, Computer Graphics Forum. 29 (2010) 397-406.

DOI: 10.1111/j.1467-8659.2009.01609.x

[6] M. Lysenko, R. D'Souza, C. Shene, Improved binary space partition merging, Comput. Aided Des. 40 (2008) 1113-1120.

DOI: 10.1016/j.cad.2008.11.002

[7] W.J. Schroeder, L.S. Avila, W. Hoffman, Visualizing with VTK: A Tutorial, IEEE Comput. Graph. Appl. 20 (2000) 20-27.

DOI: 10.1109/38.865875

[8] O. Tropp, A. Tal, I. Shimshoni, A fast triangle to triangle intersection test for collision detection, Comp. Anim. Virtual Worlds. 17 (2006) 527-535.

DOI: 10.1002/cav.115

[9] C. Ericson, Real-time collision detection (the Morgan Kaufmann series in interactive 3-D technology), Morgan Kaufmann, (2005).

DOI: 10.1016/b978-1-55860-732-3.50021-8

[10] T. Möller, A fast triangle-triangle intersection test, Journal of Graphics, GPU, and Game Tools. 2 (1997) 25-30.

DOI: 10.1080/10867651.1997.10487472

[11] M. Held, ERIT-a collection of efficient and reliable intersection tests, Journal of Graphics Tools. 2 (1998) 25-44.

DOI: 10.1080/10867651.1997.10487482

[12] J. Chang and M. Kim, Efficient triangle-triangle intersection test for OBB-based collision detection, Computers & Graphics. 33 (2009) 235-240.

DOI: 10.1016/j.cag.2009.03.009

[13] P. Guigue and O. Devillers, Fast and Robust Triangle-Triangle Overlap Test using Orientation Predicates, Journal of Graphics, GPU, and Game Tools. 8 (2003) 25-42.

DOI: 10.1201/b10628-19

[14] V. Skala, Barycentric coordinates computation in homogeneous coordinates, Computers & Graphics. 32 (2008) 120-127.

DOI: 10.1016/j.cag.2007.09.007