Abstract
This paper presents a new procedure for the detection of block contacts, an important feature in discrete element analysis. In this procedure, the block faces are taken to be convex polygons, a condition from the mathematical point of view. Upon the assumptions in blocks and the representation of contacts, the geometrical theories forming the guidelines for the computer code programming are described. The detection is designed in well-defined sequential steps, bringing the focus onto the essence of the contact problem. Attempts are made to improve the efficiency of the computational process, in comparison with existing algorithms. The detection algorithm in 3D has been programmed in C++.
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.
