Journal
COMPUTATIONAL MECHANICS
Volume 41, Issue 2, Pages 189-205Publisher
SPRINGER
DOI: 10.1007/s00466-006-0116-z
Keywords
Mortar methods; contact; contact searching; bounding volume hierarchy; finite elements
Ask authors/readers for more resources
This paper presents a new contact searching algorithm for large deformation mortar-based contact formulations. In this algorithm, a bounding volume hierarchy, defined in the context of a binary tree, is built for each contact surface based on the geometry of the surface. A global contact searching procedure based on these bounding volume trees is first performed to find all candidate contact element pairs, and then a local searching procedure is done to find all the mortar segments having contributions to the mortar integrals that define the contact formulation. The searching algorithm is shown to be very efficient and readily applicable to a variety of large sliding contact problems.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available