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

Computational Mechanics

Volumn 41, Issue 2, 2008, Pages 189-205

  Yang, Bin ^a   Laursen, Tod A ^a  

^a Duke University   (United States)

Author keywords

Bounding volume hierarchy; Contact; Contact searching; Finite elements; Mortar methods

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; FINITE ELEMENT METHOD; TREES (MATHEMATICS);

BOUNDING VOLUME HIERARCHY; CONTACT SEARCHING; MORTAR METHODS;

MORTAR;

EID: 35548959580     PISSN: 01787675     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00466-006-0116-z     Document Type: Article

References (22)

1. Puso MA, Laursen TA (2004) A mortar segment-to-segment contact method for large deformation solid Mech. Compu Methods Appl Mech Eng 193:601-629
2. Puso MA, Laursen TA (2004) A mortar segment-to-segment frictional contact method for large deformations. Comput Methods Appl Mech Eng 193:4891-4913
3. Yang B, Laursen TA, Meng XN (2005) Two dimensional mortar contact methods for large deformation frictional sliding. Int J Numer Methods Eng 62:1183-1225
4. Bernardi C, Maday Y, Patera AT (1992) A new nonconforming approach to domain decomposition: the mortar element method. In: Brezia H, Lions JL (eds) Nonlinear partial differential equations and their applications. Pitman and Wiley, pp 13-51
5. Belgacem FB, Maday Y (1994) A spectral element methodology tuned to parallel implementations. Compu Methods Appl Mech Eng 116:59-67
6. Belhachmi Z, Bernardi C (1994) Resolution of fourth order problems by the mortar element method. Comput Methods Appl Mech Eng 116:53-58
7. Wohlmuth BI (2001) Discretization methods and iterative solvers based on domain decomposition. Springer, Berlin Heidelberg New York, (2001)
8. El N-Abbasi, Bathe K-J. (2001) Stability and patch test performance of contact discretizations and a new solution algorithm. Compu and Struct 79:1473-1486
9. McDevitt TW, Laursen TA (2000) A mortar-finite element formulation for frictional contact problems. Int J Numer Methods Eng 48:1525-1547
10. Fischer KA, Wriggers P. (2005) Frictionless 2d contact formulations for finite deformations based on the mortar method. Comput Mech 36:226-244
11. Zhong Z, Nilsson L (1989) A contact searching algorithm for general contact problems. Comput Struct 33:197-209
12. Oldenburg M, Nilsson L (1994) The position code algorithm for contact searching. Int J Numer Methods Eng 37:359- 386
13. Klosowski JK, Held M, Mitchell SB, Sowizral H, Zikan K (1998) Efficient collision detection using bounding volume hierarchies of k-dops. IEEE Trans Vis Comput Graph 4:21-37
14. Kajiya JT, Kay TL (1986) Ray tracing complex scenes. ACM SIGGRAPH Comput Graph 20:269-278
15. Goldsmith J, Salmon J (1987) Automatic creation of object hierarchies for ray tracing. IEEE Comput Graph Appl 7:14-20
16. Klosowski JT, Held M, Mitchell JSB, Sowizral H, Zikan K (1998) Efficient collision detection using bounding volume hierarchies of k-DOPs. IEEE Trans Vis Comput Graph 4(1):21-36
17. van den Bergen G (1997) Efficient collision detection of complex deformable models using AABB trees. J Graph Tools 2(4):1-13
18. Mezger J, Kimmerle S, Etzmu Oß. (2000) Hierarchical techniques in collision detection for cloth animation. J WSCG 11(2):322-329
19. Gottschalk S, Lin MC, Manocha D (1996) OBBTree: ahierarchical structure for rapid interference detection. Comput Graph, 30(Annual Conference Series):171-180
20. Hubbard PM (1993) Interactive collision detection. In: IEEE symposium on research frontiers in virtual reality, IEEE. pp. 24-31
21. Garland M, Willmott AJ, Heckbert PS (2001) Hierarchical face clustering on polygonal surfaces. In: SI3D, pp. 49-58
22. Weghorst H, Hooper G, Greenberg D (1984) Improved computational methods for ray tracing. ACM Trans Graph 3:52-69