Study of the high speed blanking proccess with the C-NEM
Source abstract
Abstract
The C-NEM is a new approach that we apply to solve mechanical problem in the context of finite transformations as encountered in forming process simulation. The C-NEM (Constrained Natural Element Method) is based on the Voronoi diagram associated to the nodes spread on the studied domain. The Voronoi diagram is constrain to respect the geometry of the domain boundaries. Its ability for constructing the interpolation when the domain becomes highly distorted makes of that approach an appealing choice for simulation forming processes as for example 3D cutting and blanking. In this communication we present some aspects related to the C-NEM approach and we show its ability to simulate kinematics encountered in high velocity blanking process.
Source: openaire · Quality: candidate unverified · Source record ↗
Research context
OpenAlex topics: Metal Forming Simulation Techniques · Advanced Numerical Analysis Techniques · Metallurgy and Material Forming
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
References (11)
Show source-provided references
1. J.S. Chen, Y. Yoon, and C.T. Wu. Non-linear version of stabilized conforming nodal integration for galerkin meshfree methods. Int. J. Numer. Meth. in Engng, 53:2587–2615, 2002.10.1002/nme.338 ↗
2. G. R. Johnson and W. H. Cook. A constitutive model and data for metals subjected to large strains, high strain rates and high temperatures. In Proceeding of the 7th International Symposium on Ballistics, pages 541–547, The Hague, Holland, April 1983.
3. M. Sambridge, J. Braun, and H. McQueen. Geophysical parameterization and interpolation of irregular data using natural neighbours. Geophys. J. Int., 122:837–857, 1995.10.1111/j.1365-246X.1995.tb06841.x ↗
4. E. Sch¨onhardt. Uber die zerlegung von dreieckspolyedern in tetraeder. Math. Annalen, 98, 1928.10.1007/BF01451597 ↗
5. R. Seidel. Constrained delaunay triangulations and voronoi diagrams with obstacles. In 1978-1988 Ten Years IIG, pages 178–191, 1988.
6. JR Shewchuck. Tetrahedral mesh generation by delaunay refinement. In Proceedings of the fourteenth annual symposium on computational geometry, Minneapolis, Minnesota, pages 86–95, june 1998. association for computing machinery.10.1145/276884.276894 ↗
7. JR Shewchuck. Sweep algorithms for constructing higherdimensional constrained delaunay triangulations. In Proceedings of the sixteenth annual symposium on computational geometry, pages 350–359, june 2000. association for computing machinery.10.1145/336154.336222 ↗
8. H. Si and K. G¨artner. Meshing piecewise linear complexes by constrained delaunay tetrahedralizations. In Berlin/Heidelberg B.W. HANKS, Springer, editor, 14th International Meshing Roundtable, pages 147–163, 2005.10.1007/3-540-29090-7_9 ↗
9. R. Sibson. A vector identity for the dirichlet tesselations. Math. Proc. Camb. Phil. Soc., 87:151–155, 1980.10.1017/S0305004100056589 ↗
10. N. Sukumar, B. Moran, and T. Belytschko. The natural elements method in solid mechanics. Int. J. Numer. Meth. in Engng, 43:839–887, 1998.10.1002/(SICI)1097-0207(19981115)43:5<839::AID-NME423>3.0.CO;2-R ↗
11. J. Yvonnet, D. Ryckelynck, P. Lorong, and F. Chinesta. A new extension of the natural element method for non convex and discontinuous domains : the constrained naturalelement method (c-nem). Int. J. Numer. Meth. in Engng, 60:1451–1474, 2004.