• Transactions of Materials Processing
• /
• v.9 no.3
• /
• pp.274-283
• /
• 2000

A dynamic explicit finite element code for simulating sheet forming processes has been developed. The code utilizes the discrete Kirchhoff shell element and contact force is treated by a conventional penalty method. In order to reduce the computational cost, a new and robust contact searching algorithm has been developed and implemented into the code. In the method, a hierarchical structure of tool segments is built for each tool at the initial stage of the analysis. hierarchical structure is built in a way to divide a box to 8 sub-boxes, 2 in each direction, until the lowest level of the hierarchical structure contains exactly one segment of the tool or empty. Then at each time step, contact is checked from the box to sub-boxes hierarchically for each node. Comparisons of computational results of various examples with the existing ones show the validity of the method.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1999.03b
• /
• pp.22-25
• /
• 1999

A dynamic explicit finite element code for simulating sheet forming processes has been developed The code utilises the discrete Kirchhoff shell element and contact force is treated by a conventional penalty method. In order to reduce the computational cost a new and robust contact searching algorithm has been developed and implemented into the code. in the method a hierarchical structure of tool segments called a tree structure is built for each tool at the initial stage of the analysis Tree is built in a way to divide a trunk to 8 sub-trunk 2 in each direction until the lowest level of the tree(leaf) contains exactly one segment of the tool. In order to have a well-balanced tree each box on each sub level contains one eighth of the segments. Then at each time step contact line from a node comes out of the surface of the tool. Simulation of various sheet forming processes were performed to verify the validity of the developed code with main focus on he usefulness of the developed contact searching algorithm.