×

zbMATH — the first resource for mathematics

Surface triangulation over intersecting geometries. (English) Zbl 0932.74081
We describe a method for rapid construction of meshes over intersecting triangulated shapes. The method is based on an algorithm that automatically generates a surface mesh from intersecting triangulated surfaces by means of Boolean intersection/union operations. After the intersection of individual components is obtained, the exposed surface parts are extracted. The algorithm is intended for rapid interactive construction of nontrivial surfaces in engineering design, manufacturing, visualization and molecular modelling applications.

MSC:
74S99 Numerical and other methods in solid mechanics
76M99 Basic methods in fluid mechanics
65N50 Mesh generation, refinement, and adaptive methods for boundary value problems involving PDEs
65M50 Mesh generation, refinement, and adaptive methods for the numerical solution of initial value and initial-boundary value problems involving PDEs
PDF BibTeX Cite
Full Text: DOI
References:
[1] Löhner, Int. J. Numer. Meth. Fluids 8 pp 1135– (1988)
[2] Shostko, Int. J. Numer. Meth. Engng. 38 pp 905– (1995)
[3] ?Extending the range of applicability and automation of the advancing front grid generation technique?, 34th Aerospace Sciences Meeting and Exhibit, Reno, NV, January 1996.
[4] Watson, Comput. J. 24 pp 162– (1981)
[5] Weatherhill, Comput. Math. Appl. 24 pp 129– (1992)
[6] Shepard, Int. J. Numer. Meth. Engng. 20 pp 1965– (1991)
[7] Blacker, Int. J. Numer. Meth. Engng. 32 pp 811– (1991)
[8] ?Curves and surfaces for computer-aided geometric design, A practical guide?, Academic Press, New York, 1988. · Zbl 0694.68004
[9] Lo, Int. J. Numer. Meth. Engng. 38 pp 943– (1995)
[10] and ?Robust and efficient Cartesian mesh generation for component-based geometry?, 35th AIAA Aerospace Sciences Meeting and Exhibit 6-9 January 1997.
[11] Schroeder, Comput. Graphics 26 pp 65– (1992)
[12] Hoppe, Comput. Graphics 26 (1992)
[13] and Computer Graphics, Principles and Practice, Addison-Wesley, Reading, MA, 1990.
[14] Turk, Computer Graphics 26 pp 55– (1992)
[15] Murzin, J. Mol. Biol. 247 pp 536– (1995)
[16] Löhner, Commun. Appl. Numer. Meth. 4 pp 123– (1988)
[17] and ?Data Structures, an Advanced Approach using C?, Prentice Hall Software Series, Englewood Cliffs, N.J., 1989.
[18] and ?Mathematical modeling of 3D protein molecule potential in nonlinear media?, ?Physique en Herbe 92?, Congress, Marseille, 6-10 July 1992.
[19] Richards, Ann. Rev. Biophys. Bioengng. 6 pp 151–
[20] Shrake, J. Mol. Biol. (1973)
[21] Richmond, J. Mol. Biol. (1984)
[22] and ?Fast analytical computation of Richard’s Smooth molecular surface?, Visualization Proc., 1993.
[23] Zauharr, J. Comput.-Aided Mol. Des. 9 pp 149– (1995)
[24] Connolly, Science 221 pp 1983–
[25] Richards, Ann. Rev. Biophys. Bioengng. 6 pp 151– (1977)
[26] Biochemistry, W. H. Freeman and Company, San Francisco, 1995.
[27] Lee, J. Mol. Biol. 55 pp 379– (1971)
[28] and ?Parallel adaptive finite element flow solver?, Proc. of AIAA 12th Computational Fluid Dynamics Meeting, San Diego, June 1995.
[29] and ?Polygonization of non-manifold implicit surfaces?, Siggraph 1995 Conf. Proc., 1995.
[30] Sandberg, J. Mol. Phys.
[31] Pratt, Comput. Graphics, SIGGRAPH’87 Proceedings 21 pp 145– (1987)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.