2004
DOI: 10.1016/j.compgeo.2004.08.002
|View full text |Cite
|
Sign up to set email alerts
|

A fast contact detection algorithm for 3-D discrete element method

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
109
0
1

Year Published

2008
2008
2023
2023

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 215 publications
(110 citation statements)
references
References 25 publications
0
109
0
1
Order By: Relevance
“…Recently, Nezami et al (2004) described a method founded on a mathematical analysis by which to orientate the CP that did not require iterations and hence dramatically increased the speed of the original CP algorithm. A multi-step contact detection procedure consisting of spatial domain decomposition and axis-aligned bounding boxes; and this fast common-plane (FCP) algorithm presented by Nezami et al (2004) forms the basis of the updated algorithm within DECICE.…”
Section: Algorithm Improvementmentioning
confidence: 99%
See 1 more Smart Citation
“…Recently, Nezami et al (2004) described a method founded on a mathematical analysis by which to orientate the CP that did not require iterations and hence dramatically increased the speed of the original CP algorithm. A multi-step contact detection procedure consisting of spatial domain decomposition and axis-aligned bounding boxes; and this fast common-plane (FCP) algorithm presented by Nezami et al (2004) forms the basis of the updated algorithm within DECICE.…”
Section: Algorithm Improvementmentioning
confidence: 99%
“…A multi-step contact detection procedure consisting of spatial domain decomposition and axis-aligned bounding boxes; and this fast common-plane (FCP) algorithm presented by Nezami et al (2004) forms the basis of the updated algorithm within DECICE. The new algorithm required a complete redevelopment of the algorithms and data arrays associated with the contact detection within DECICE.…”
Section: Algorithm Improvementmentioning
confidence: 99%
“…A speed-up ratio R is defined as the ratio of the CPU run time for the direct search algorithm to that of the new fast direct search algorithm. Both the initial contact detection procedure and the updated contact detection procedure in the fast direct search algorithm and the fast common plane algorithm [3] are tested.…”
Section: Basic 3-d Modelmentioning
confidence: 99%
“…The common plane simplifies the contact detection process by testing the relationship of the common plane and each block instead of the relationship of two blocks. This approach was further optimized to produce the fast common plane (FCP) algorithm [3] and the shortest link method (SLM) [4]. Another genre is referred to as the direct search or improved direct search algorithms [8][9][10].…”
Section: Introductionmentioning
confidence: 99%
“…When dealing with large slips, nodeon-segment contact algorithms can be used [4]. In this context, powerful contact research algorithms have been presented [3,11,13,17,21,24,34,35]. Most of these algorithms have a complex implementation and any lack of robusteness may impede the convergence of the process especially when the equilibrium equation are handled by implicit schemes.…”
Section: Introductionmentioning
confidence: 99%