.png){kind=icon}
.png){kind=icon}
Return
A fast contact detection algorithm for 3-D discrete element method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compgeo.2004.08.002.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In the discrete element method, determining the contact points between interacting particles and the associated contact normals at each time step is a critically important and time consuming calculation. Common-plane (CP) algorithm is one of the more effective methods for contact detection when dealing with two-dimensional polygonal or three-dimensional polyhedral particles. A new approach, called fast common plane (FCP) method, is proposed to find the common plane between polygonal particles. FCP approach recognizes that a common plane has identifying characteristics, which dramatically reduce the search space for the common plane. In two-dimensions, the CP is found by checking only 5 possible candidate planes. In three-dimensions, the candidate planes fall within 4 types related to the geometry of the particles and their relative positions. Numerical experiments reveal that in three dimensions FCP algorithm can be up to 40 times faster than available search methods for finding the common-plane. (C) 2004 Elsevier Ltd. All rights reserved.
Keywords:
GRANULAR-MATERIALS
SIMULATION
MODEL
ASSEMBLIES
FRICTION
STRESS
MOTION
MILLS
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.2
Papers:
7.0K
Citations:
2.9W
Organization
No organization information available