Procedure for contact detection in discrete element analysis
暂无分享,去创建一个
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++.
[1] P. A. Cundall,et al. NUMERICAL MODELLING OF DISCONTINUA , 1992 .
[2] John R. Williams,et al. A linear complexity intersection algorithm for discrete element simulation of arbitrary geometries , 1995 .
[3] John R. Williams,et al. SUPERQUADRICS AND MODAL DYNAMICS FOR DISCRETE ELEMENTS IN INTERACTIVE DESIGN , 1992 .