In this paper the calculation and administration for motion and contacts of systems is investigated that are consisting of many colliding bodies. Both, two dimensional (2D) and three dimensional (3D) cases are investigated. In order to reduce the high calculation time that is usually spent on collision detection, sophisticated sorting algorithms for the neighborhood search are required. Here, these algorithms are compared with respect to their efficiency, for systems consisting of spherical 3D bodies of different sizes. The very time consuming collision detection then only needs to be done for neighboring bodies. The collision detection for polygonal bodies as well as the determination of the contact geometry is alluded. In order to simulate a very high number of contacting bodies, methods from Molecular Dynamics are used. By means of constitutive equations, the contact force can be determined, as addressed for polygonal bodies.
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.