A fast direct search algorithm for contact detection of convex polygonal or polyhedral particles
- Author(s): Zheng, F
- Jiao, YY
- Gardner, M
- Sitar, N
- et al.
Published Web Locationhttps://doi.org/10.1016/j.compgeo.2017.02.001
© 2017 Elsevier Ltd 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.
Many UC-authored scholarly publications are freely available on this site because of the UC Academic Senate's Open Access Policy. Let us know how this access is important for you.