Efficient and Accurate Collision Detection for Granular Flow Simulation

Vemuri, Baba C.; Chen, L.; Vu‐Quoc, L.; Zhang, X.; Walton, Otis R.

doi:10.1006/gmip.1998.0479

Cited by 30 publications

(9 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Time efficiency is generally stated as a function relating to the total CPU time for contact check. In the following numerical tests, contact detection time T c is the total execution time of the routine on the computer related to the contact detection between particles and structural boundaries of the assembled pipe . Data related with the contacts between particles and quadrilateral meshes that occurred in the numerical tests are recorded for further analysis, which include contacts count C u of particles within the surfaces of quadrilateral meshes and contacts count C i of particles with the sides shared by quadrilateral meshes and triangle meshes.…”

Section: Numerical Testsmentioning

confidence: 99%

A method for representing structural boundaries by mathematical equations and triangle meshes in DEM simulations

Fang

et al. 2017

Numerical Meth Engineering

View full text Add to dashboard Cite

Summary The representation of structural boundaries is of significant importance for the applications of the discrete element method in an industry. In recent decades, triangle meshes are extensively used for representing structural boundaries. Structural boundaries of industrial objects are composed by regular shapes and irregular shapes in many occasions. A method for representing structural boundaries with regular shapes and irregular shapes has been developed by combining mathematical equations and triangle meshes for computational efficiency. When structural boundaries are represented by mathematical equations and triangle meshes, gaps or protuberances may exist at the connection boundaries between regular shapes and irregular shapes. For the exactness of representation of structural boundaries, gaps or protuberances are identified, expressed and treated successively, so that the geometrical shapes composed by regular shapes described with mathematical equations and irregular shapes described with triangle meshes can replace the original structural shapes. Two series of numerical tests have been conducted to verify this method. The results showed that this method can effectively represent complicated structural boundaries containing regular shapes and irregular shapes and greatly reduce computational cost in the contact detection between particles and structural boundaries. Copyright © 2016 John Wiley & Sons, Ltd.

show abstract

Section: Numerical Testsmentioning

confidence: 99%

A method for representing structural boundaries by mathematical equations and triangle meshes in DEM simulations

Fang

et al. 2017

Numerical Meth Engineering

View full text Add to dashboard Cite

show abstract

“…However, smoothed particles being point geometries, we use the Octree space partitioning. Vemuri et al 15 used the Octree for granular flow which is very similar to our application. We use fourth order Runge-Kutta integration method to integrate the dynamics.…”

Section: Efficient Implementation Of Smoothed Particle Hydrodynamicsmentioning

confidence: 99%

Modeling Dynamic Hair as a Continuum

Hadap

Magnenat‐Thalmann

2001

Computer Graphics Forum

119

View full text Add to dashboard Cite

In this paper we address the difficult problem of hair dynamics, particularly hair‐hair and hair‐air interactions. To model these interactions, we propose to consider hair volume as a continuum. Subsequently, we treat the interaction dynamics to be fluid dynamics. This proves to be a strong as well as viable approach for an otherwise very complex phenomenon. However, we retain the individual character of hair, which is vital to visually realistic rendering of hair animation. For that, we develop an elaborate model for stiffness and inertial dynamics of individual hair strand. Being a reduced coordinate formulation, the stiffness dynamics is numerically stable and fast. We then unify the continuum interaction dynamics and the individual hair's stiffness dynamics.

show abstract

“…A cell-based search is then performed over the data tree to determine which particles inhabit neighboring cells, and the use of the data tree mitigates the sensitivity to spatial distribution as compared to a basic cell-based search. While such methods have the advantage of not searching over any empty cells [3], the cells in methods described in the literature must still be larger than the diameter of the largest particle in the system [5,7], meaning that such methods are still subject to performance degradation if particles are not all of similar size. However, with a more sophisticated binning technique, such as the use of an adaptive grid method [3], the drawback of being limited to particles of similar size might be lessened or eliminated.…”

Section: Introductionmentioning

confidence: 98%

“…Next is a contact detection stage, often subdivided into a 'coarse' stage where nearby, potentially contacting neighbors are identified, and a 'resolution' stage where the program determines which pairs of particles are actually in contact [5]. The purpose of the coarse contact detection stage, when used, is to avoid a global one-on-one contact search, which is an O (n 2 ) operation, for an n-particle system.…”

Section: Introductionmentioning

confidence: 99%

“…A more advanced method that builds on simple spatial discretization is the use of binary search trees [8,9], sometimes called octrees in three dimensions [5,3]. As in the basic search method, the simulation space is discretized into rectilinear cells, and particles are placed into cells based on the locations of their centers or centers of mass.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation