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

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 p...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Computational mechanics Ročník 41; číslo 2; s. 189 - 205
Hlavní autoři: Yang, Bin, Laursen, Tod A.
Médium: Journal Article
Jazyk:angličtina
Vydáno: Berlin/Heidelberg Springer-Verlag 01.01.2008
Springer Nature B.V
Témata:
Algorithms
Classical and Continuum Physics
Computational Science and Engineering
Deformation
Engineering
Formulations
Mortars (material)
Original Paper
Search algorithms
Sliding contact
Theoretical and Applied Mechanics
Finite elements
Contact searching
Bounding volume hierarchy
Mortar methods
Contact
ISSN:0178-7675, 1432-0924
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-7675
1432-0924
DOI:10.1007/s00466-006-0116-z