Journal
COMPUTERS AND GEOTECHNICS
Volume 87, Issue -, Pages 76-85Publisher
ELSEVIER SCI LTD
DOI: 10.1016/j.compgeo.2017.02.001
Keywords
Contact detection; Convex particles; Valid entrance; Initial detection; Updated detection
Categories
Funding
- National Basic Research Program of China (973 Program) [2014CB046904, 2014CB047101]
- China National Natural Science Foundation [51479191]
- China Scholarship Council
- U.S. National Science Foundation (NSF) [CMMI1363354]
- Edward G. Cahill and John R. Cahill Endowed Chair funds
Ask authors/readers for more resources
A fast direct search (FDS) algorithm is presented to increase the efficiency of contact detection for convex polygonal and polyhedral particles. All contact types are detected using only a small subset of these contact types: vertex-to-edge for polygons while vertex-to-face and edge-to-edge for polyhedra. First, an initial contact list is generated. Then in subsequent steps the contact list is updated by checking only local boundaries of the blocks and their separation. An exclusion algorithm is applied to avoid unnecessary examination for particles that are near but not-in-contact. The benchmark tests show that the FDS produces significant speed-up in various cases. (C) 2017 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available