BMSweep: Locating interior nodes during sweeping

Engineering with Computers

Volumn 15, Issue 3, 1999, Pages 212-218

  Staten, M L ^a   Canann, S A ^a   Owen, S J ^a  

^a ANSYS INC   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INTERPOLATION;

MAPPED MESHING; MESH GENERATION;

COMPUTATIONAL GEOMETRY;

EID: 0032597989     PISSN: 01770667     EISSN: None     Source Type: Journal    
DOI: 10.1007/s003660050016     Document Type: Article

References (16)

1. Cifuentes, A. O., Kalbag, A. (1992) A performance study of tetrahedral and hexahedral elements in 3-D finite element structural analysis. Finite Elements in Analysis and Design, 12, 313-318
2. Benzley, S. E., Perry, E., Merkley, K, Clark, B., Sjaardema, G. (1995) A comparison of all-hexahedral and all-tetrahedral finite element meshes for elastic and elasto-plastic analysis. Proc 4th Int Meshing Roundtable 95, 179-191
3. Mitchell, S. A. (1996) A characterization of the quadrilateral meshes of a surface which admit a compatible hexahedral mesh of the enclosed volume. Proc 13th Annual Symposium on Theoretical Aspects of Computer Science (STAGS '96), Lecture Nodes in Computer Science, 1046, Springer-Verlag, 465-476
4. Blacker, T. (1996) The Cooper Tool. Proc 5th Int Meshing Roundtable 96, 13-29
5. Mingwu, L., and Benzley, S. E. (1996) A multiple source and target sweeping method for generating all hexahedral finite element meshes. Proc, 5th Int Meshing Roundtable 96, 217-225
6. Liu, S. S., and Gadh, R. (1997) Automatic hexahedral mesh generation by recursive convex and swept volume decomposition. Proc, 6th Int Meshing Roundtable 97, 217-231
7. Shih, B., Sakurai, H. (1997) Shape recognition and shape-specific meshing for generating all hexahedral meshes. Proc 6th Int Meshing Roundtable 97, 197-209
8. White, D. W., Mingwu, L., Benzley, S. E. (1995) Automated hexahedral mesh generation by virtual decomposition. Proc 4 Int Meshing Roundtable 95, 165-176
9. Chiba, N., Nishigaki, I., Yamashita, Y., Takizawa, C. Fujishiro, K. (1996) An automatic hexahedral mesh generation system based on the shape-recognition and boundary-fit methods. Proc 5th Int Meshing Roundtable 96, 281-290
10. Canann, S. A., Tristano, J. R., Staten, M. L. (1998) An approach to combined Laplacian and optimization-based smoothing for triangular, quadrilateral, and quad-dominant meshes. Proc 7th Int Meshing Roundtable 98, 479-494.
11. Tristano, J. R., Owen, S. J., Canann, S. A. (1998) Advancing front surface mesh generation in parametric space using Riemannian surface definition. Proc 7th Int Meshing Roundtable 98, 429-445
12. Owen, S. J., Staten, M. L., Canann, S. A., Saigal, S. (1998) Advancing front quadrilateral meshing using triangle transformations. Proc 7th Int Meshing Roundtable 98, 409-428
13. White, D. R. (1996) Automatic, quadrilateral and hexahedral meshing of pseudo-cartesian geometries using virtual decomposition. Master's Thesis, Brigham Young University, August
14. Mirante, A., Weingarten, N. (1982) The radial sweep algorithm for constructing triangulated irregular networks. IEEE Computer Graphics and Applications, 2(3), 11-21
15. Lee, D. T., Schacter, B. J. (1980) Two algorithms for constructing a Delaunay triangulation. Int J Computer and Information Sciences, 9(3), 219-242
16. Watson, D. F. (1981) Computing the Delaunay tessellation with application to Voroni Polytopes. Computer Journal, 24, 167-172