A contact searching algorithm including bounding volume trees applied to finite sliding mortar formulations

Abstract

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.