Abstract
In discontinuity based numerical methods, determining the contact points between interacting blocks and the associated contact forces at each time step is an important and time consuming calculation. This paper presents a new algorithm for detection of all contact patterns between any two convex blocks. In the new developed method one of the two approaching faces is considered as “main plane” and vertices of another face that are within the tolerance of the main plane are stored. Then, according to the number of gathered points, different algorithms for searching real contact points and the type in global coordinate system are applied. Finally, the dominant contact of neighboring blocks is identified using the contacts found between approaching faces.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
